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

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

Latest revision as of 13:25, 10 December 2024

scientific article
Language Label Description Also known as
English
Approximating the maximum clique minor and some subgraph homeomorphism problems
scientific article

    Statements

    Approximating the maximum clique minor and some subgraph homeomorphism problems (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2009
    0 references
    approximation
    0 references
    graph minors
    0 references
    graph homeomorphism
    0 references
    0 references
    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