scientific article; zbMATH DE number 5005081

MaRDI QIDQ3368883zbMATH OpenFDO

Authors Xiaolin Yang, Yuanqiu Huang

Publication date 8 February 2006

zbMATH Keywords

NP-completestable setvertex partition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Complexity of graph partition problems
• Some graph partitioning problems
• A P-complete graph partition problem
• A graph partition problem
• A graph partition problem
• On the complexity of partitioning a graph into a few connected subgraphs
• On the complexity of some edge-partition problems for graphs
• On the complexity of partitioning graphs into connected subgraphs
• On the complexity of some partition problems
• A note on the computational complexity of graph vertex partition

Cited in

(5)

• On the complexity of partitioning graphs into connected subgraphs
• scientific article; zbMATH DE number 4094840 (Why is no real title available?)
• ON TWO GRAPH PARTITIONING QUESTIONS
• A note on the computational complexity of graph vertex partition
• A note on formulations for the \(A\)-partition problem on hypergraphs

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