Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 2038758

From MaRDI portal
Publication:4449223
Jump to:navigation, search

zbMath1039.68093MaRDI QIDQ4449223

Dimitrios M. Thilikos, Fedor V. Fomin, Erik D. Demaine, Mohammad Taghi Hajiaghayi

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190829.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items

A parameterized approximation algorithm for the multiple allocation \(k\)-hub center, Branchwidth of chordal graphs, Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction, Linear time algorithms for finding a dominating set of fixed size in degenerated graphs, A refined search tree technique for dominating set on planar graphs



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4449223&oldid=18501235"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 05:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki