scientific article; zbMATH DE number 742981

MaRDI QIDQ4763420zbMATH OpenFDO

Authors André E. Kézdy, Patrick J. McGuinness

Publication date 11 April 1995

zbMATH Keywords

homeomorphic subgraphminorparallel algorithmplanarseparatorssequential algorithm

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Coloring algorithms for \(K_ 5\)-minor free graphs
• A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences
• Optimization and Recognition for K 5-minor Free Graphs in Linear Time
• Two parallel algorithms for finding all minimal maximum subsequences
• Refined F5 Algorithms for Ideals of Minors of Square Matrices
• scientific article; zbMATH DE number 1979505
• Minimal Polynomial Algorithms for Finite Sequences
• Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
• scientific article; zbMATH DE number 24457
• Implementation and parallelization of a reverse-search algorithm for Minkowski sums

Cited in

(10)

• Structure and recognition of graphs with no 6-wheel subdivision
• Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.
• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
• Efficient algorithms for acyclic colorings of graphs
• Dynamic coloring of graphs having no \(K_5\) minor
• Searching forK_3,3in linear time
• On even circuit decompositions of eulerian graphs
• Revising the Fellows-Kaschube \(K_{3,3}\) search
• Optimization and Recognition for K 5-minor Free Graphs in Linear Time
• NC algorithms for partitioning sparse graphs into induced forests with an application

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 Q4763420)