A linear algorithm for resource four-partitioning four-connected planar graphs

zbMATH Open1253.05130MaRDI QIDQ1928628FDOQ1928628

Authors: Tanveer Awal, Md. Saidur Rahman 

Publication date: 3 January 2013

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• A linear-time algorithm for four-partitioning four-connected planar graphs
• scientific article; zbMATH DE number 1262808
• scientific article; zbMATH DE number 409492
• Algorithms and Computation
• scientific article; zbMATH DE number 4195169

zbMATH Keywords

vertex partitionlinear algorithmreource vertexresource 4-partition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) 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 (1)

• A linear-time algorithm for four-partitioning four-connected planar graphs

This page was built for publication: A linear algorithm for resource four-partitioning four-connected planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928628)