Show simple item record

dc.contributor.author
Dobrev, Stefan
dc.contributor.author
Královič, Rastislav
dc.contributor.author
Královič, Richard
dc.date.accessioned
2017-06-11T16:26:35Z
dc.date.available
2017-06-11T16:26:35Z
dc.date.issued
2015-01
dc.identifier.issn
1432-4350
dc.identifier.issn
1433-0490
dc.identifier.other
10.1007/s00224-014-9592-2
dc.identifier.uri
http://hdl.handle.net/20.500.11850/98816
dc.language.iso
en
dc.publisher
Springer
dc.subject
Online algorithms
dc.subject
Advice complexity
dc.subject
Maximum independent set
dc.title
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs
dc.type
Journal Article
ethz.journal.title
Theory of Computing Systems
ethz.journal.volume
56
ethz.journal.issue
1
ethz.journal.abbreviated
Theory comput. syst. (Print)
ethz.pages.start
197
ethz.pages.end
219
ethz.notes
Published online 8 November 2014.
ethz.identifier.wos
ethz.identifier.nebis
001721816
ethz.publication.place
New York, NY
ethz.publication.status
published
ethz.date.deposited
2017-06-11T16:26:42Z
ethz.source
ECIT
ethz.identifier.importid
imp593652fc9a4b564491
ethz.ecitpid
pub:154606
ethz.eth
yes
ethz.availability
Metadata only
ethz.rosetta.installDate
2017-07-13T12:18:02Z
ethz.rosetta.lastUpdated
2020-02-14T15:05:06Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Advice%20Complexity%20of%20Maximum%20Independent%20set%20in%20Sparse%20and%20Bipartite%20Graphs&rft.jtitle=Theory%20of%20Computing%20Systems&rft.date=2015-01&rft.volume=56&rft.issue=1&rft.spage=197&rft.epage=219&rft.issn=1432-4350&1433-0490&rft.au=Dobrev,%20Stefan&Kr%C3%A1lovi%C4%8D,%20Rastislav&Kr%C3%A1lovi%C4%8D,%20Richard&rft.genre=article&rft_id=info:doi/10.1007/s00224-014-9592-2&
 Search print copy at ETH Library

Files in this item

FilesSizeFormatOpen in viewer

There are no files associated with this item.

Publication type

Show simple item record