On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory

DOI10.1016/S0012-365X(97)00147-7zbMath0889.68117MaRDI QIDQ1379838

Barbara C. Plaut, Michael A. Langston

Publication date: 25 February 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

search algorithmsclosure-preserving operatorsself-reductions

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Linear-time algorithms for problems on planar graphs with fixed disk dimension ⋮ FPT Suspects and Tough Customers: Open Problems of Downey and Fellows ⋮ Clustering with Local Restrictions ⋮ Complete graph immersions in dense graphs ⋮ Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover

Cites Work

• Unnamed Item
• Unnamed Item
• Graph minors XXIII. Nash-Williams' immersion conjecture
• The complexity of parallel search
• On search, decision, and the efficiency of polynomial-time algorithms
• Graph minors. XIII: The disjoint paths problem
• Random-Self-Reducibility of Complete Sets
• Nonconstructive tools for proving polynomial-time decidability
• On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
• A linear time algorithm for finding tree-decompositions of small treewidth

This page was built for publication: On algorithmic applications of the immersion order: An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory