scientific article; zbMATH DE number 3946182

zbMATH Open0589.05055MaRDI QIDQ3717092FDOQ3717092

Authors: Khristo Nikolov Dzhidzhev 

Publication date: 1985

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

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

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)

Cited In (11)

• Anticoloring and separation of graphs
• How to catch marathon cheaters: new approximation algorithms for tracking paths
• Planarization of graphs embedded on surfaces
• Title not available (Why is that?)
• Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
• A separator theorem for graphs of bounded genus
• A linear time algorithm for graph partition problems
• Edge separators for graphs of bounded genus with applications
• Approximating small balanced vertex separators in almost linear time
• Edge Partition of Toroidal Graphs into Forests in Linear Time
• Anticoloring of a family of grid 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)