A rooted-forest partition with uniform vertex demand
From MaRDI portal
Publication:695323
DOI10.1007/s10878-010-9367-xzbMath1281.90078OpenAlexW1974201616MaRDI QIDQ695323
Naoki Katoh, Shin-ichi Tanigawa
Publication date: 21 December 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9367-x
Related Items (3)
A characterisation of the generic rigidity of 2-dimensional point-line frameworks ⋮ Antistrong digraphs ⋮ On Maximal Independent Arborescence Packing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Body-and-cad geometric constraint systems
- A note on disjoint arborescences
- A network theory approach to the rigidity of skeletal structures. II: Laman's theorem and topological formulae
- Arc-disjoint in-trees in directed graphs
- Sparsity-certifying graph decompositions
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
- A linear-time algorithm for finding a minimum spanning pseudoforest
- Forests, frames, and games: Algorithms for matroid sums and applications
- A new proof of Laman's theorem
- Constructive characterizations for packing and covering with trees
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Pebble game algorithms and sparse graphs
- Submodular functions and independence structures
- On the degrees of the vertices of a directed graph
- On graphs and rigidity of plane skeletal structures
- Linking (n-2)-dimensional panels in n-space. II: (n-2,2)-frameworks and body and Hinge structures
- NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- On the Infinitesimal Rigidity of Bar-and-Slider Frameworks
- The Union of Matroids and the Rigidity of Frameworks
- Algorithms - ESA 2003
This page was built for publication: A rooted-forest partition with uniform vertex demand
