Typical sequences revisited -- computing width parameters of graphs (Q2701067): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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/s00224-021-10030-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3150373505 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126176055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for treewidth / 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: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivation of algorithms for cutwidth and related graph layout parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250226 / 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: Constructive linear time algorithms for branchwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Computation of Path-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “Art of Trellis Decoding” Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling expression DAGs for minimal register need / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036591 / 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: Complete Register Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generation of Optimal Code for Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth I: A linear time fixed parameter algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutwidth II: Algorithms for partial w-trees of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank

Latest revision as of 00:28, 1 August 2024

scientific article
Language Label Description Also known as
English
Typical sequences revisited -- computing width parameters of graphs
scientific article

    Statements

    Typical sequences revisited -- computing width parameters of graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2023
    0 references
    typical sequences
    0 references
    treewidth
    0 references
    series parallel digraphs
    0 references
    cutwidth
    0 references
    modified cutwidth
    0 references

    Identifiers

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