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

Theoretical Computer Science - Netherlands
doi 10.1016/j.tcs.2018.11.025
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Some Applications of Spanning Trees in Complete and Complete Bipartite Graphs

American Journal of Applied Sciences
Multidisciplinary
2012English

Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Complexity of Products of Some Complete and Complete Bipartite Graphs

Journal of Applied Mathematics
Applied Mathematics
2013English

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

The Complexity of Dissociation Set Problems in Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal

2020English

On Dominating and Spanning Circuits in Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1994English

Trees With Α-Labelings and Decompositions of Complete Graphs Into Non-Symmetric Isomorphic Spanning Trees

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2005English

Correction To: Weighted Upper Edge Cover: Complexity and Approximability

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy