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

A generalization of AT-free graphs and a generic algorithm for solving triangulation problems

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

DOI10.1007/s00453-001-0091-xzbMath1009.68099OpenAlexW2105257834MaRDI QIDQ1348907

Ton Kloks, Dieter Kratsch, Haiko Müller, Hajo J. Broersma

Publication date: 21 May 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0091-x

zbMATH Keywords

asteroidal tripleasteroidal set


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)


Related Items

The firefighter problem on graph classes, On treewidth approximations., On asteroidal sets in chordal graphs, Feedback vertex set on AT-free graphs, Computing the branchwidth of interval graphs, Unnamed Item



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