Certifying induced subgraphs in large graphs (Q6091166): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Design and Engineering of External Memory Traversal Algorithms for General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The buffer tree: A technique for designing batched external data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential and Parallel Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Latest revision as of 14:24, 19 August 2024

scientific article; zbMATH DE number 7770295
Language Label Description Also known as
English
Certifying induced subgraphs in large graphs
scientific article; zbMATH DE number 7770295

    Statements

    Certifying induced subgraphs in large graphs (English)
    0 references
    24 November 2023
    0 references
    certifying algorithm
    0 references
    graph algorithm
    0 references
    external memory
    0 references

    Identifiers