Exact algorithms for intervalizing coloured graphs (Q255264): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59480234, #quickstatements; #temporary_batch_1712190744730
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The hardness of intervalizing four colored caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the proper intervalization of colored caterpillar trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intervalizing \(k\)-colored graphs for DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on exact algorithms for vertex ordering problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On exact algorithms for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded degree interval sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating Vertex-Colored Graphs / rank
 
Normal rank

Revision as of 13:40, 11 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for intervalizing coloured graphs
scientific article

    Statements

    Exact algorithms for intervalizing coloured graphs (English)
    0 references
    0 references
    0 references
    9 March 2016
    0 references
    graph algorithms
    0 references
    exact algorithms
    0 references
    interval graphs
    0 references
    subexponential time
    0 references
    intervalizing coloured graphs
    0 references
    pathwidth
    0 references

    Identifiers

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