Faster algorithms for finding and counting subgraphs
type: Item
instance of: scholarly article
title: Faster algorithms for finding and counting subgraphs
zbMATH Open document ID: 1246.05149
author: Fedor V. Fomin
author: Daniel Lokshtanov
author: Venkatesh Raman
author: Saket Saurabh
author: B. V. Raghavendra Rao
published in: Journal of Computer and System Sciences
publication date: 2012-08-17T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6067699
zbMATH Keywords: parameterized complexity
zbMATH Keywords: subgraph isomorphism
zbMATH Keywords: homomorphism
zbMATH Keywords: counting
zbMATH Keywords: treewidth
Wikidata QID: Q60488486
MaRDI profile type: Publication
full work available at URL: j.jcss.2011.10.001
OpenAlex ID: W2089369802
cites work: Balanced families of perfect hash functions and their applications
cites work: Color-coding
cites work: Counting Subgraphs via Homomorphisms
cites work: Counting Paths and Packings in Halves
cites work: Narrow sieves for parameterized paths and packings
cites work: Trimmed Moebius inversion and graphs of bounded degree
cites work: Q3424888
cites work: Q4331740
cites work: Q2934608
cites work: Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
cites work: Counting \(H-\)colorings of partial \(k-\)trees
cites work: The Parameterized Complexity of Counting Problems
cites work: Computational aspects of the Mobius transformation of graphs
cites work: The vertex separation number of a graph equals its path-width
cites work: Treewidth. Computations and approximations
cites work: Divide-and-Color
cites work: Faster Algebraic Algorithms for Path and Packing Problems
cites work: Limits and Applications of Group Algebras for Parameterized Problems
cites work: Finding, minimizing, and counting weighted subgraphs
cites work: Finding paths of length \(k\) in \(O^{*}(2^k)\) time
DOI: 10.1016/J.JCSS.2011.10.001
DBLP publication ID: journals/jcss/FominLRSR12
description: scientific article; zbMATH DE number 6067699