The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (Q6089686): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
Property / DOI
 
Property / DOI: 10.4230/lipics.ipec.2020.37 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2020.37 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3117577989 / rank
 
Normal rank
Property / title
 
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (English)
Property / title: The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (English) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6089675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6089676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6089677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5075772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex ranking problem for trapezoid, circular-arc and other graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper) / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Encodings for Treecut Width and Treedepth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Dissection of a Regular Finite Element Mesh / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Evolution of the Minimum Degree Ordering Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Bisection with Pareto Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treedepth Parameterized by Vertex Cover Number. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6089678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On low tree-depth decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Parameterized Algorithm for Treedepth / 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: Optimal node ranking of tree in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: PACE Solver Description: Tree Depth with FlowCutter / rank
 
Normal rank
Property / cites work
 
Property / cites work: PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive-Instance Driven Dynamic Programming for Treewidth. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive-instance driven dynamic programming for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6089683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6089684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6089685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6089680 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.IPEC.2020.37 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:20, 30 December 2024

scientific article; zbMATH DE number 7764128
Language Label Description Also known as
English
The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth.
scientific article; zbMATH DE number 7764128

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 November 2023
    0 references
    computing treedepth
    0 references
    contest
    0 references
    implementation challenge
    0 references
    FPT
    0 references
    The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth. (English)
    0 references
    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