Optimum matching forests II: General weights (Q3922479): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q5668821 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4197644 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimum branchings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5675543 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4078069 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimum matching forests I: Special weights / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimum matching forests III: Facets of matching forest polyhedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4080661 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5603731 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Factorization of Linear Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Factors of Graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01581023 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2082699538 / rank | |||
Normal rank |
Latest revision as of 11:10, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimum matching forests II: General weights |
scientific article |
Statements
Optimum matching forests II: General weights (English)
0 references
1982
0 references
optimum matching forests
0 references
branchings
0 references
directed graph
0 references
matchings
0 references
undirected graph
0 references
polyhedron
0 references
edge weights
0 references