Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Publisher： Elsevier

ISSN： 0025-5610

Source： Mathematical Programming, Vol.82, Iss.1, 1998-06, pp. : 83-109

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Signpost systems and spanning trees of graphs

By Nebeský Ladislav

Czechoslovak Mathematical Journal, Vol. 56, Iss. 3, 2006-09 ,pp. : 885-893

Springer Publishing Company

Access to resources Recommend Favorite

Edge‐Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs

JOURNAL OF GRAPH THEORY, Vol. 81, Iss. 1, 2016-01 ,pp. : 16-29

John Wiley & Sons Inc

Access to resources Recommend Favorite

Rainbow spanning trees in complete graphs colored by one‐factorizations

JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,pp. : 333-346

John Wiley & Sons Inc

Access to resources Recommend Favorite

The Number of Spanning Trees in K_n-Complements of Quasi-Threshold Graphs

By Nikolopoulos Stavros D. Papadopoulos Charis

Graphs and Combinatorics, Vol. 20, Iss. 3, 2004-08 ,pp. : 383-397

Springer Publishing Company

Access to resources Recommend Favorite

Degree Bounded Spanning Trees

By Fujisawa Jun

Graphs and Combinatorics, Vol. 26, Iss. 5, 2010-09 ,pp. : 695-720

Springer Publishing Company

Access to resources Recommend Favorite