The Complexity of Dissociation Set Problems in Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2011.04.023
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

The Complexity of Planning Problems With Simple Causal Graphs

Journal of Artificial Intelligence Research
Artificial Intelligence
2008English

On the Linear Extension Complexity of Stable Set Polytopes for Perfect Graphs

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

The Complexity of Several Realizability Problems for Abstract Topological Graphs

English

On the Complexity of Shortest Path Problems on Discounted Cost Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Robust Maximum Weighted Independent-Set Problems on Interval Graphs

SSRN Electronic Journal
2011English

On the Complexity of Reinforcement in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2016English

Complexity and Approximability of Extended Spanning Star Forest Problems in General and Complete Graphs

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

The Complexity of Pebbling in Diameter Two Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy