Some aspects of perfect elimination orderings in chordal graphs (Q792351): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Douglas R. Shier / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q792350 / rank
Normal rank
 
Property / author
 
Property / author: Douglas R. Shier / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Bal Kishan Dass / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially bounded algorithms for locatingp-centers on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
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: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence in nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Interval-Ordered Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated graphs and the elimination process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:34, 14 June 2024

scientific article
Language Label Description Also known as
English
Some aspects of perfect elimination orderings in chordal graphs
scientific article

    Statements

    Some aspects of perfect elimination orderings in chordal graphs (English)
    0 references
    1984
    0 references
    The present paper intends to study properties of perfect elimination orderings in chordal graphs. Their connections to convex subsets and quasiconcave functions in a graph are discussed. Schemes for generating all perfect elimination orderings are investigated and related to the existing schemes.
    0 references
    perfect elimination orderings
    0 references
    chordal graphs
    0 references
    quasiconcave functions
    0 references
    0 references

    Identifiers