Show simple item record

dc.contributor.author
Feldmann, Andreas Emil
dc.contributor.author
Widmayer, Peter
dc.date.accessioned
2017-06-09T18:16:32Z
dc.date.available
2017-06-09T18:16:32Z
dc.date.issued
2011
dc.identifier.isbn
978-3-642-23718-8
dc.identifier.isbn
978-3-642-23719-5
dc.identifier.issn
0302-9743
dc.identifier.issn
1611-3349
dc.identifier.other
10.1007/978-3-642-23719-5_13
dc.identifier.uri
http://hdl.handle.net/20.500.11850/43711
dc.language.iso
en
dc.publisher
Springer
dc.title
An O(n^4) Time Algorithm to Compute the Bisection Width of Grid Graphs
dc.type
Conference Paper
ethz.book.title
Algorithms – ESA 2011
ethz.journal.title
Lecture Notes in Computer Science
ethz.journal.volume
6942
ethz.journal.abbreviated
LNCS
ethz.pages.start
143
ethz.pages.end
154
ethz.event
19th Annual European Symposium (ESA 2011)
ethz.event.location
Saarbrücken, Germany
ethz.event.date
September 5-9, 2011
ethz.notes
.
ethz.identifier.nebis
000025969
ethz.publication.place
Berlin
ethz.publication.status
published
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::03340 - Widmayer, Peter (emeritus) / Widmayer, Peter (emeritus)
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::03340 - Widmayer, Peter (emeritus) / Widmayer, Peter (emeritus)
ethz.date.deposited
2017-06-09T18:16:45Z
ethz.source
ECIT
ethz.identifier.importid
imp59364ecee68e713850
ethz.ecitpid
pub:72341
ethz.eth
yes
ethz.availability
Metadata only
ethz.rosetta.installDate
2017-07-12T22:06:39Z
ethz.rosetta.lastUpdated
2019-02-02T05:39:45Z
ethz.rosetta.exportRequired
true
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=An%20O(n%5E4)%20Time%20Algorithm%20to%20Compute%20the%20Bisection%20Width%20of%20Grid%20Graphs&rft.jtitle=Lecture%20Notes%20in%20Computer%20Science&rft.date=2011&rft.volume=6942&rft.spage=143&rft.epage=154&rft.issn=0302-9743&1611-3349&rft.au=Feldmann,%20Andreas%20Emil&Widmayer,%20Peter&rft.isbn=978-3-642-23718-8&978-3-642-23719-5&rft.genre=proceeding&rft_id=info:doi/978-3-642-23718-8&info:doi/978-3-642-23719-5&rft.btitle=Algorithms%20%E2%80%93%20ESA%202011
 Search via SFX

Files in this item

FilesSizeFormatOpen in viewer

There are no files associated with this item.

Publication type

Show simple item record