Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2816059
Jump to:navigation, search

zbMath1412.05183MaRDI QIDQ2816059

Hans L. Bodlaender

Publication date: 1 July 2016

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065305801167?np=y

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

treewidthgraph algorithmspartial \(k\)-tree


Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (4)

As Time Goes By: Reflections on Treewidth for Temporal Graphs ⋮ Parameterized orientable deletion ⋮ Structural parameters, tight bounds, and approximation for \((k, r)\)-center ⋮ Structurally parameterized \(d\)-scattered set






This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2816059&oldid=15722961"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 17:56.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki