Faster algorithms for finding and counting subgraphs
- 20 October 2011
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 78 (3) , 698-706
Abstract
No abstract availableKeywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Balanced families of perfect hash functions and their applicationsACM Transactions on Algorithms, 2010
- Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problemJournal of Computer and System Sciences, 2010
- Finding, minimizing, and counting weighted subgraphs2009
- Trimmed Moebius Inversion and Graphs of Bounded DegreeTheory of Computing Systems, 2009
- Biomolecular network motif counting and discovery by color codingBioinformatics, 2008
- The Parameterized Complexity of Counting ProblemsSIAM Journal on Computing, 2004
- Counting H-colorings of partial k-treesTheoretical Computer Science, 2002
- Color-codingJournal of the ACM, 1995
- The vertex separation number of a graph equals its path-widthInformation Processing Letters, 1992
- Computational aspects of the Mobius transformation of graphsIEEE Transactions on Systems, Man, and Cybernetics, 1992