scientific article; zbMATH DE number 3946182

MaRDI QIDQ3717092zbMATHFDO

Authors Khristo Nikolov Dzhidzhev

Publication date 1985

zbMATH Keywords

graph partitiongenusefficient algorithmsdivide-and-conquer method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
• A separator theorem for graphs of bounded genus
• scientific article; zbMATH DE number 3970774
• A linear time algorithm for graph partition problems
• scientific article; zbMATH DE number 4101213

Cited in

(12)

• Approximating small balanced vertex separators in almost linear time
• Edge separators for graphs of bounded genus with applications
• How to catch marathon cheaters: new approximation algorithms for tracking paths
• Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems
• Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
• Edge Partition of Toroidal Graphs into Forests in Linear Time
• scientific article; zbMATH DE number 3970774 (Why is no real title available?)
• A linear time algorithm for graph partition problems
• Planarization of graphs embedded on surfaces
• Anticoloring of a family of grid graphs
• A separator theorem for graphs of bounded genus
• Anticoloring and separation of 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 Q3717092)