Faster algorithms for finding and counting subgraphs (Q439930): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2011.10.001 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2011.10.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089369802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced families of perfect hash functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Subgraphs via Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Paths and Packings in Halves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrow sieves for parameterized paths and packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trimmed Moebius inversion and graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting \(H-\)colorings of partial \(k-\)trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of Counting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of the Mobius transformation of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divide-and-Color / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algebraic Algorithms for Path and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits and Applications of Group Algebras for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding, minimizing, and counting weighted subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2011.10.001 / rank
 
Normal rank

Latest revision as of 17:44, 9 December 2024

scientific article
Language Label Description Also known as
English
Faster algorithms for finding and counting subgraphs
scientific article

    Statements

    Faster algorithms for finding and counting subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 August 2012
    0 references
    parameterized complexity
    0 references
    subgraph isomorphism
    0 references
    homomorphism
    0 references
    counting
    0 references
    treewidth
    0 references

    Identifiers

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