Doubly lexical ordering of dense 0--1 matrices (Q2366069): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Characterizations of totally balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of acyclicity for hypergraphs and relational database schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally-Balanced and Greedy Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Lexical Orderings of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank

Latest revision as of 18:07, 17 May 2024

scientific article
Language Label Description Also known as
English
Doubly lexical ordering of dense 0--1 matrices
scientific article

    Statements

    Doubly lexical ordering of dense 0--1 matrices (English)
    0 references
    0 references
    29 June 1993
    0 references
    strongly chordal graphs
    0 references
    totally balanced matrix
    0 references
    chordal bipartite graphs
    0 references
    doubly lexical ordering
    0 references

    Identifiers