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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+On the Complete Width and Edge Clique Cover Problems
@@ description / en / description / en @@
+scientific article; zbMATH DE number 6501943
@@ Property / DOI @@
-.1007/s10878-016-0106-9
@@ Property / DOI: 10.1007/s10878-016-0106-9 / rank @@
-Normal rank
@@ Property / title @@
+On the Complete Width and Edge Clique Cover Problems (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05145
@@ Property / zbMATH Open document ID: 1465.05145 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-21398-9_42
@@ Property / DOI: 10.1007/978-3-319-21398-9_42 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-016-0106-9
@@ Property / DOI: 10.1007/S10878-016-0106-9 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+October 2015Timestamp +2015-10-29T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2015-10-29T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 29 October 2015 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6501943
@@ Property / zbMATH DE Number: 6501943 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+split graphs
@@ Property / zbMATH Keywords: split graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bipartite graphs
@@ Property / zbMATH Keywords: bipartite graphs / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2562739206
@@ Property / OpenAlex ID: W2562739206 / rank @@
+Normal rank
@@ 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
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Cover and Graph Separation: New Incompressibility Results
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828541
@@ Property / cites work: Q4828541 / rank @@
+Normal rank
@@ Property / cites work @@
+Data reduction and exact algorithms for clique cover
+Normal rank
@@ Property / cites work @@
+A survey of the algorithmic aspects of modular decomposition
+Normal rank
@@ Property / cites work @@
+On the complete width and edge clique cover problems
+Normal rank
@@ Property / cites work @@
+Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
+Normal rank

Latest revision as of 02:56, 28 December 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