Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

SIAM Journal on Computing - United States
doi 10.1137/s0097539796303044
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Precoloring Extension on Chordal Graphs

English

Distance Approximating Trees for Chordal and Dually Chordal Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Clique Graphs of Chordal and Path Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1994English

Clique-Cutsets Beyond Chordal Graphs

Journal of Graph Theory
GeometryTopology
2018English

Almost All Chordal Graphs Split

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1985English

Clique R-Domination and Clique R-Packing Problems on Dually Chordal Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1997English

Retracts of Products of Chordal Graphs

Journal of Graph Theory
GeometryTopology
2012English

Tree Spanners on Chordal Graphs: Complexity and Algorithms

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2004English

The Black-And-White Coloring Problem on Chordal Graphs

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy