Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts

doi 10.1109/focs.2014.22
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Efficiently Counting Vertex Orbits of All 5-Vertex Subgraphs, by EVOKE

2020English

Parameterized Complexity of Generalized Vertex Cover Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

DEVELOPMENT: Counting Counts

Science
MultidisciplinaryPhilosophy of ScienceHistory
2002English

It's Counting That Counts

International Journal of Celiac Disease
PulmonaryRespiratory Medicine
2016English

Revisiting the Vertex Cover of Graphs

Applied Mathematical Sciences
2015English

On the Number of Dissimilar Line-Subgraphs of a Given Graph

Pacific Journal of Mathematics
Mathematics
1956English

Domination Number of the Acquaint Vertex Gluing of Graphs

Applied Mathematical Sciences
2014English

On the Complexity of Partitioning a Graph Into a Few Connected Subgraphs

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2013English

The Upper Connected Vertex Detour Number of a Graph

Filomat
Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy