Zur Kurzanzeige

dc.contributor.author
Fürer, Martin
dc.contributor.editor
Mäkinen, Veli
dc.contributor.editor
Puglisi, Simon J.
dc.contributor.editor
Salmela, Leena
dc.date.accessioned
2019-10-01T07:03:36Z
dc.date.available
2017-06-12T12:03:59Z
dc.date.available
2019-10-01T07:03:36Z
dc.date.issued
2016
dc.identifier.isbn
978-3-319-44542-7
en_US
dc.identifier.isbn
978-3-319-44543-4
en_US
dc.identifier.issn
0302-9743
dc.identifier.issn
1611-3349
dc.identifier.other
10.1007/978-3-319-44543-4_30
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/120141
dc.language.iso
en
en_US
dc.publisher
Springer
en_US
dc.subject
Path-width
en_US
dc.subject
Tree-width
en_US
dc.subject
Bodlaender’s algorithm
en_US
dc.subject
Path decomposition
en_US
dc.subject
FPT
en_US
dc.title
Faster computation of path-width
en_US
dc.type
Conference Paper
dc.date.published
2016-08-09
ethz.book.title
Combinatorial Algorithms
en_US
ethz.journal.title
Lecture Notes in Computer Science
ethz.journal.volume
9843
en_US
ethz.journal.abbreviated
LNCS
ethz.pages.start
385
en_US
ethz.pages.end
396
en_US
ethz.event
27th International Workshop on Combinatorial Algorithms (IWOCA 2016)
en_US
ethz.event.location
Helsinki, Finland
en_US
ethz.event.date
August 17-19, 2016
en_US
ethz.identifier.scopus
ethz.identifier.nebis
007342601
ethz.publication.place
Cham
en_US
ethz.publication.status
published
en_US
ethz.date.deposited
2017-06-12T12:07:02Z
ethz.source
ECIT
ethz.identifier.importid
imp593654af0de6182754
ethz.ecitpid
pub:182193
ethz.eth
yes
en_US
ethz.availability
Metadata only
en_US
ethz.rosetta.installDate
2017-07-18T11:56:08Z
ethz.rosetta.lastUpdated
2021-02-15T06:04:39Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Faster%20computation%20of%20path-width&rft.jtitle=Lecture%20Notes%20in%20Computer%20Science&rft.date=2016&rft.volume=9843&rft.spage=385&rft.epage=396&rft.issn=0302-9743&1611-3349&rft.au=F%C3%BCrer,%20Martin&rft.isbn=978-3-319-44542-7&978-3-319-44543-4&rft.genre=proceeding&rft_id=info:doi/10.1007/978-3-319-44543-4_30&rft.btitle=Combinatorial%20Algorithms
 Printexemplar via ETH-Bibliothek suchen

Dateien zu diesem Eintrag

DateienGrößeFormatIm Viewer öffnen

Zu diesem Eintrag gibt es keine Dateien.

Publikationstyp

Zur Kurzanzeige