2009 | OriginalPaper | Chapter
Algorithms on Subtree Filament Graphs
Author : Fanica Gavril
Published in: Graph Theory, Computational Intelligence and Thought
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We describe polynomial time algorithms to find in subtree filament graphs a minimum dominating hole, a clique intersecting all its maximum independent sets and a maximum induced split subgraph.