scientific article; zbMATH DE number 5005081

zbMATH Open1090.05065MaRDI QIDQ3368883FDOQ3368883

Authors: Xiaolin Yang, Yuanqiu Huang 

Publication date: 8 February 2006

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

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

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)

Cited In (5)

• Title not available (Why is that?)
• A note on formulations for the \(A\)-partition problem on hypergraphs
• On the complexity of partitioning graphs into connected subgraphs
• ON TWO GRAPH PARTITIONING QUESTIONS
• A note on the computational complexity of graph vertex partition

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)