On recognizing graph properties from adjacency matrices (Q1238421): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4046079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete subgraphs are elusive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5770541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time required to detect cycles and connectivity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4181269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4766997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank

Latest revision as of 20:37, 12 June 2024

scientific article
Language Label Description Also known as
English
On recognizing graph properties from adjacency matrices
scientific article

    Statements

    On recognizing graph properties from adjacency matrices (English)
    0 references
    0 references
    0 references
    1977
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references