On the complete width and edge clique cover problems (Q721937): Difference between revisions

Revision as of 23:18, 10 July 2024

scientific article; zbMATH DE number 6501943

On the Complete Width and Edge Clique Cover Problems

Language	Label	Description	Also known as
English	On the complete width and edge clique cover problems	scientific article; zbMATH DE number 6501943	On the Complete Width and Edge Clique Cover Problems

Statements

instance of

scholarly article

0 references

title

On the complete width and edge clique cover problems (English)

0 references

On the Complete Width and Edge Clique Cover Problems (English)

0 references

0 references

0 references

Journal of Combinatorial Optimization

0 references

Lecture Notes in Computer Science

0 references

publication date

20 July 2018

0 references

29 October 2015

0 references

full work available at URL

https://arxiv.org/abs/1612.08057

0 references

zbMATH Keywords

probe graphs

0 references

complete width

0 references

edge clique cover

0 references

split graphs

0 references

bipartite graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Graphs with no induced \(C_ 4\) and \(2K_ 2\)

0 references

Graph Classes: A Survey

0 references

On probe permutation graphs

0 references

Block-graph width

0 references

Q4448745

0 references

Q3035328

0 references

Known Algorithms for Edge Clique Cover are Probably Optimal

0 references

Algorithmic graph theory and perfect graphs

0 references

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover

0 references

Difference graphs

0 references

The NP-Completeness of Some Edge-Partition Problems

0 references

Q4016827

0 references

Linear time algorithms on circular-arc graphs

0 references

Covering edges by cliques with regard to keyword conflicts and intersection graphs

0 references

Characterizing and recognizing probe block graphs

0 references

Linear recognition of pseudo-split graphs

0 references

Threshold graphs and related topics

0 references

On edge perfectness and classes of bipartite graphs

0 references

Q4152571

0 references

Clique Covering of Graphs IV. Algorithms

0 references

Q3820643

0 references

Node-Deletion Problems on Bipartite Graphs

0 references

Identifiers

zbMATH Open document ID

1393.05211

0 references

1465.05145

0 references

DOI

10.1007/s10878-016-0106-9

0 references

10.1007/978-3-319-21398-9_42

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:721937

@@ Property / cites work @@
+Graphs with no induced \(C_ 4\) and \(2K_ 2\)
@@ Property / cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\) / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+On probe permutation graphs
@@ Property / cites work: On probe permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Block-graph width
@@ Property / cites work: Block-graph width / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448745
@@ Property / cites work: Q4448745 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3035328
@@ Property / cites work: Q3035328 / rank @@
+Normal rank
@@ Property / cites work @@
+Known Algorithms for Edge Clique Cover are Probably Optimal
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
+Normal rank
@@ Property / cites work @@
+Difference graphs
@@ Property / cites work: Difference graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Some Edge-Partition Problems
+Normal rank
@@ Property / cites work @@
+Q4016827
@@ Property / cites work: Q4016827 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms on circular-arc graphs
@@ Property / cites work: Linear time algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Covering edges by cliques with regard to keyword conflicts and intersection graphs
+Normal rank
@@ Property / cites work @@
+Characterizing and recognizing probe block graphs
@@ Property / cites work: Characterizing and recognizing probe block graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear recognition of pseudo-split graphs
@@ Property / cites work: Linear recognition of pseudo-split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold graphs and related topics
@@ Property / cites work: Threshold graphs and related topics / rank @@
+Normal rank
@@ Property / cites work @@
+On edge perfectness and classes of bipartite graphs
+Normal rank
@@ Property / cites work @@
+Q4152571
@@ Property / cites work: Q4152571 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Covering of Graphs IV. Algorithms
@@ Property / cites work: Clique Covering of Graphs IV. Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3820643
@@ Property / cites work: Q3820643 / rank @@
+Normal rank
@@ Property / cites work @@
+Node-Deletion Problems on Bipartite Graphs
@@ Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank @@
+Normal rank