scientific article; zbMATH DE number 3752239

MaRDI QIDQ3936211zbMATH OpenFDO

Authors Hristo N. Djidjev

Publication date 1981

zbMATH Keywords

divide-and-conquerfixed genusplanar graph

Mathematics Subject Classification ID

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

Cited in

(8)

• Finding small simple cycle separators for 2-connected planar graphs
• Approximation algorithms for weighted matching
• Edge separators for graphs of bounded genus with applications
• On the minimum load coloring problem
• Short and simple cycle separators in planar graphs
• Product structure of graphs with an excluded minor
• Product structure of graph classes with strongly sublinear separators
• Shortest path separators in unit disk 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 Q3936211)