Approximating the pathwidth of outerplanar graphs (Q293398): 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6590770 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
pathwidth
Property / zbMATH Keywords: pathwidth / rank
 
Normal rank
Property / zbMATH Keywords
 
outerplanar graphs
Property / zbMATH Keywords: outerplanar graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation
Property / zbMATH Keywords: approximation / rank
 
Normal rank
Property / zbMATH Keywords
 
tree decomposition
Property / zbMATH Keywords: tree decomposition / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Q4734761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for longest (s,t)-paths in weighted outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation and search number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Narrowness, pathwidth, and their application in natural language processing / 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 02:38, 12 July 2024

scientific article
Language Label Description Also known as
English
Approximating the pathwidth of outerplanar graphs
scientific article

    Statements

    Identifiers