An algorithm for packing connectors

DOI10.1006/JCTB.1998.1863MaRDI QIDQ1569028zbMATH OpenOpenAlexFDO

Authors N. Delaunay

Publication date 25 June 2000

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/1274d238c5cb5caf22bd6e5c7cae5c7d5848820f

zbMATH Keywords

graphic matroidsspanning trees

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On packing connectors
• Integral packing of trees and branchings
• Packing of Steiner trees and \(S\)-connectors in graphs
• A matroid approach to finding edge connectivity and packing arborescences
• Packing Spanning Trees

Cites work

• Disjoint Common Transversals and Exchange Structures
• Edge-Disjoint Spanning Trees of Finite Graphs
• Forests, frames, and games: Algorithms for matroid sums and applications
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3297031 (Why is no real title available?)
• On packing connectors
• On the Problem of Decomposing a Graph into n Connected Factors

Cited in

(5)

• On packing connectors
• Adjacency, inseparability, and base orderability in matroids
• Constructions of sparse asymmetric connectors with number theoretic methods
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• COOMA: a components overlaid mining algorithm for enumerating connected subgraphs with common itemsets

This page was built for publication: An algorithm for packing connectors

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