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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Cover and Graph Separation: New Incompressibility Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data reduction and exact algorithms for clique cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complete width and edge clique cover problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank

Revision as of 04:01, 16 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

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
20 July 2018
0 references
29 October 2015
0 references
probe graphs
0 references
complete width
0 references
edge clique cover
0 references
split graphs
0 references
bipartite graphs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references