Maximum vertex-weighted matching in strongly chordal graphs (Q1392564): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Doubly Lexical Orderings of Matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching is as easy as matrix inversion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three Partition Refinement Algorithms / rank | |||
Normal rank |
Latest revision as of 13:28, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum vertex-weighted matching in strongly chordal graphs |
scientific article |
Statements
Maximum vertex-weighted matching in strongly chordal graphs (English)
0 references
28 July 1998
0 references
vertex-weight
0 references
matching
0 references
linear time algorithm
0 references
strongly chordal graph
0 references