scientific article; zbMATH DE number 2038758

MaRDI QIDQ4449223zbMATH OpenFDO

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

Publication date 8 February 2004

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

Mathematics Subject Classification ID

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

Recommendations

• Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
• scientific article; zbMATH DE number 7278055
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center
• scientific article; zbMATH DE number 1756013
• Parameterized complexity: exponential speed-up for planar graph problems

Cited in

(10)

• 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
• Structural parameters, tight bounds, and approximation for \((k, r)\)-center
• A refined search tree technique for dominating set on planar graphs
• Obnoxious centers in graphs
• Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
• scientific article; zbMATH DE number 7278055 (Why is no real title available?)
• Approximating k-center in planar graphs
• A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
• Branchwidth of chordal 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 Q4449223)