A general purpose algorithm for counting simple cycles and simple paths of any length (Q2415361): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KONECT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098109735 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1612.05531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Subgraphs via Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite-difference sieve to count paths and cycles by length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms to count paths and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Listing of Cycles and st-Paths in Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of \(n\)-cycles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4812915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural sparsity of complex networks: bounded expansion in random models and real-world graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Subgraph Isomorphism Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph Isomorphism in Planar Graphs and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating simple paths from connected induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: What's in a crowd? Analysis of face-to-face behavioral networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All the Elementary Circuits of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming meets the principle of inclusion and exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5648388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of isolating and counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Algorithms for Enumerating All Circuits of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-hook characters and hamiltonian circuits<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immanantal invariants of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of counting cycles using zeons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:31, 19 July 2024

scientific article
Language Label Description Also known as
English
A general purpose algorithm for counting simple cycles and simple paths of any length
scientific article

    Statements

    A general purpose algorithm for counting simple cycles and simple paths of any length (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 May 2019
    0 references
    simple cycles
    0 references
    simple paths
    0 references
    self-avoiding walks
    0 references
    self-avoiding polygons
    0 references
    elementary circuits
    0 references
    connected induced subgraphs
    0 references
    networks
    0 references
    digraphs
    0 references
    labeled graphs
    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