Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Marked Items 
Alerts
Order History
Saved Items
All
Favorites
    
Book Chapter Printable view
The maximum <i>k</i>-dependent and <i>f</i>-dependent set problem

The maximum k-dependent and f-dependent set problem

Book SeriesLecture Notes in Computer Science
PublisherSpringer Berlin / Heidelberg
ISSN0302-9743 (Print) 1611-3349 (Online)
VolumeVolume 762/1993
BookAlgorithms and Computation
DOI10.1007/3-540-57568-5
Copyright1993
ISBN978-3-540-57568-9
DOI10.1007/3-540-57568-5_238
Pages88-97
Subject CollectionComputer Science
SpringerLink DateSaturday, January 21, 2006
Add to marked items

The maximum k-dependent and f-dependent set problem

Anders Dessmark1, Klaus Jansen2 and Andrzej Lingas1

(1)  Department Computer Science, Lund University, Box 118, 221 00 Lund, Sweden
(2)  Fachbereich 11, Informatik, Universität Duisburg, 47048 Duisburg, Germany
Without Abstract
Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.
more options
Find


Export this chapter
Export this chapter as RIS | Text
 
Frequently asked questions | General information on journals and books | Send us your feedback | Impressum | Contact
© Springer. Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
Remote Address: 38.107.191.111 • Server: mpweb23
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)