Computing and listing avoidable vertices and paths (Q6108998): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Vertex elimination orderings for hereditary graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable vertices and edges in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph extremities defined by search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum cardinality search for computing minimal triangulations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability generalizes Dirac's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A vertex incremental approach for maintaining chordality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable paths in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of AT‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifting paths to avoidable ones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal triangulations of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Minimum Circuit in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting small induced subgraphs efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Between<i>O</i>(<i>nm</i>) and<i>O</i>(<i>n<sup>alpha</sup></i>) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal triangulation of a graph and optimal pivoting order in a sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and listing avoidable vertices and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for the diameter and radius of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for optimal 2-constraint satisfaction and its implications / rank
 
Normal rank

Latest revision as of 10:27, 2 August 2024

scientific article; zbMATH DE number 7719340
Language Label Description Also known as
English
Computing and listing avoidable vertices and paths
scientific article; zbMATH DE number 7719340

    Statements

    Computing and listing avoidable vertices and paths (English)
    0 references
    0 references
    0 references
    26 July 2023
    0 references

    Identifiers

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