Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2006.12.021
@@ Property / DOI: 10.1016/j.tcs.2006.12.021 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2006.12.021
+Normal rank
@@ Property / OpenAlex ID @@
+W1982718046
@@ Property / OpenAlex ID: W1982718046 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Finding a Path of Superlogarithmic Length
@@ Property / cites work: Finding a Path of Superlogarithmic Length / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+On Linear Time Minor Tests with Depth-First Search
+Normal rank
@@ Property / cites work @@
+The Pathwidth and Treewidth of Cographs
@@ Property / cites work: The Pathwidth and Treewidth of Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
+Normal rank
@@ Property / cites work @@
+Q3236250
@@ Property / cites work: Q3236250 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4003200
@@ Property / cites work: Q4003200 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754129
@@ Property / cites work: Q2754129 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3883524
@@ Property / cites work: Q3883524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921667
@@ Property / cites work: Q2921667 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Longest Cycle Problem in Sparse Graphs
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Clique by Removing Subgraphs
+Normal rank
@@ Property / cites work @@
+Finding paths and cycles of superpolylogarithmic length
+Normal rank
@@ Property / cites work @@
+Q5501241
@@ Property / cites work: Q5501241 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequential and parallel algorithms for embedding problems on classes of partial k-trees
+Normal rank
@@ Property / cites work @@
+The complexity of subgraph isomorphism for classes of partial k-trees
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q3048571
@@ Property / cites work: Q3048571 / rank @@
+Normal rank
@@ Property / cites work @@
+The approximation of maximum subgraph problems
@@ Property / cites work: The approximation of maximum subgraph problems / rank @@
+Normal rank
@@ Property / cites work @@
+On approximating the longest path in a graph
@@ Property / cites work: On approximating the longest path in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bound of the Hadwiger number of graphs by their average degree
+Normal rank
@@ Property / cites work @@
+Topological cliques in graphs II
@@ Property / cites work: Topological cliques in graphs II / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921751
@@ Property / cites work: Q2921751 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding iso- and other morphisms for partial \(k\)- trees
+Normal rank
@@ Property / cites work @@
+Q3128907
@@ Property / cites work: Q3128907 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+An extremal function for contractions of graphs
@@ Property / cites work: An extremal function for contractions of graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2006.12.021
@@ Property / DOI: 10.1016/J.TCS.2006.12.021 / rank @@
+Normal rank