New Clique and Independent Set Algorithms for Circle Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/0166-218x(93)90038-p
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Clique Family Inequalities for the Stable Set Polytope of Quasi-Line Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2003English

Clique Graphs of Chordal and Path Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1994English

On Clique Convergent Graphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
1995English

An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2010English

Exact Algorithms for Dominating Clique Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Clique-Cutsets Beyond Chordal Graphs

Journal of Graph Theory
GeometryTopology
2018English

Efficient Independent Set Approximation in Unit Disk Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Robust Maximum Weighted Independent-Set Problems on Interval Graphs

SSRN Electronic Journal
2011English

Clique Coloring of Binomial Random Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy