scientific article; zbMATH DE number 2230227
From MaRDI portal
Publication:5708519
zbMath1075.05588MaRDI QIDQ5708519
Liliane R. B. Salgado, Yoshiko Wakabayashi
Publication date: 18 November 2005
Full work available at URL: http://www.sciencedirect.com/science/journal/15710653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- A linear-time algorithm for four-partitioning four-connected planar graphs
- Approximating the Maximally Balanced Connected Partition Problem in graphs
- A linear algorithm for bipartition of biconnected graphs
- On the complexity of partitioning graphs into connected subgraphs
- On the complexity of finding multi-constrained spanning trees
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph
- A short note on the approximability of the maximum leaves spanning tree problem
- On the approximability of some Maximum Spanning Tree Problems
- Clustering on trees
- Most uniform path partitioning and its use in image processing
- The shifting algorithm technique for the partitioning of trees
- Max-Min Tree Partitioning
- The complexity of restricted spanning tree problems
- A homology theory for spanning tress of a graph
- Max-min partitioning of grid graphs into connected components
- A polynomial-time algorithm for max-min partitioning of ladders
This page was built for publication:
