Directed width parameters on semicomplete digraphs (Q2150583): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_48 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4206381755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-width is PSPACE-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: DAG-Width and Parity Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dag-width of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting the directed grid theorem into an \textsf{FPT} algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A well-quasi-order for tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On width measures and topological problems on semi-complete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament pathwidth and topological containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph width measures in parameterized algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are there any good digraph width measures? / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to compute digraph width measures on directed co-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing linear width parameters for directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the relationship between NLC-width and linear NLC-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed NLC-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraph measures: Kelly decompositions, games, and orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:46, 29 July 2024

scientific article
Language Label Description Also known as
English
Directed width parameters on semicomplete digraphs
scientific article

    Statements

    Directed width parameters on semicomplete digraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 2022
    0 references
    algorithmic meta theorem
    0 references
    semicomplete digraphs
    0 references
    directed clique-width
    0 references
    directed tree-width
    0 references

    Identifiers