wiki_research

personal research wiki
git clone https://a3nm.net/git/wiki_research/
Log | Files | Refs

subgraph_counting (443B)

      1 # Subgraph counting
      2 
      3 For a class \calH of graph, the *subgraph counting problem* is the following: given a graph G and a pattern graph H in \calH, count how many [subgraphs] of G are [graph_isomorphic] to H
      4 
      5 Studied in [curticapean2014complexity]: on [recursively_enumerable] classes \calH, tractable if and only if \calH has bounded [vertex_cover_number]
      6 
      7 Up: [counting_problem]
      8 
      9 See also: [Graph_packing]
     10 
     11 Aliases: subgraph counting problem