Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 5764892

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

zbMATH Open1192.05161MaRDI QIDQ3579485FDOQ3579485


Authors: Ken-ichi Kawarabayashi, Bruce Reed Edit this on Wikidata


Publication date: 6 August 2010



Title of this publication is not available (Why is that?)




Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Nonnumerical algorithms (68W05)



Cited In (7)

  • A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
  • The disjoint paths problem in quadratic time
  • A Linear-Time Parameterized Algorithm for Node Unique Label Cover
  • All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
  • Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
  • Subexponential algorithms for partial cover problems
  • Towards the graph minor theorems for directed graphs





This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579485)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3579485&oldid=16983843"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 02:44. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki