BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES (Q2905308): Difference between revisions

Latest revision as of 12:01, 30 July 2024

scientific article

Language	Label	Description	Also known as
English	BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES	scientific article

Statements

instance of

scholarly article

0 references

title

BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES (English)

0 references

zbMATH Open document ID

1247.05243

0 references

DOI

10.1142/S1793830912500085

0 references

0 references

0 references

Discrete Mathematics, Algorithms and Applications

0 references

publication date

27 August 2012

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

fixed-parameter tractability

0 references

edge-deletion

0 references

graph modification

0 references

cographs

0 references

trivially perfect graphs

0 references

quasi-threshold graphs

0 references

bounded search tree

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Graph Classes: A Survey

0 references

A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs

0 references

Fixed-parameter tractability of graph modification problems for hereditary properties

0 references

Matrix multiplication via arithmetic progressions

0 references

A Linear Recognition Algorithm for Cographs

0 references

Parameterized algorithms for $d$-hitting set: the weighted case

0 references

On extended $P_4$-reducible and extended $P_4$-sparse graphs

0 references

Automated generation of search tree algorithms for hard graphs modification problems

0 references

Recognizing $P_4 $-Sparse Graphs in Linear Time

0 references

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

0 references

BetweenO(nm) andO(nalpha)

0 references

Characterizing and computing minimal cograph completions

0 references

Modular decomposition and transitive orientation

0 references

An efficient fixed-parameter algorithm for 3-hitting set

0 references

On a property of the class of n-colorable graphs

0 references

Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs

0 references

The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems

0 references

full work available at URL

https://doi.org/10.1142/s1793830912500085

0 references

OpenAlex ID

W2024836278

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2905308

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+Matrix multiplication via arithmetic progressions
@@ Property / cites work: Matrix multiplication via arithmetic progressions / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for \(d\)-hitting set: the weighted case
+Normal rank
@@ Property / cites work @@
+On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
+Normal rank
@@ Property / cites work @@
+Automated generation of search tree algorithms for hard graphs modification problems
+Normal rank
@@ Property / cites work @@
+Recognizing $P_4 $-Sparse Graphs in Linear Time
@@ Property / cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Between<i>O</i>(<i>nm</i>) and<i>O</i>(<i>n<sup>alpha</sup></i>)
+Normal rank
@@ Property / cites work @@
+Characterizing and computing minimal cograph completions
+Normal rank
@@ Property / cites work @@
+Modular decomposition and transitive orientation
@@ Property / cites work: Modular decomposition and transitive orientation / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient fixed-parameter algorithm for 3-hitting set
+Normal rank
@@ Property / cites work @@
+On a property of the class of n-colorable graphs
@@ Property / cites work: On a property of the class of n-colorable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s1793830912500085
+Normal rank
@@ Property / OpenAlex ID @@
+W2024836278
@@ Property / OpenAlex ID: W2024836278 / rank @@
+Normal rank