Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture is true for almost every graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5110876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for certain parameterized NP-hard problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms are a good basis for counting small subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding even cycles faster via capped k-walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of fixed parameter clique and dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting and Counting Small Pattern Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced subgraph isomorphism: are some patterns substantially easier than others? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for finding and counting subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607951 / 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: Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor / 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: A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting and Detecting Small Subgraphs via Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Primes in the Interval [3n, 4n] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the interval containing at least one prime number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear-time algorithm for computing the center of an interval graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The four-colour theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding, minimizing, and counting weighted subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Four-Node Subgraphs in Triangle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding even cycles even faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501266 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:02, 27 July 2024

scientific article; zbMATH DE number 7430751
Language Label Description Also known as
English
Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles
scientific article; zbMATH DE number 7430751

    Statements

    Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (English)
    0 references
    19 November 2021
    0 references
    fine-grained complexity
    0 references
    subgraph isomorphism
    0 references
    cliques
    0 references
    cycle detection
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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