Algorithms on Subtree Filament Graphs

Authors:
Fanica Gavril
Affiliations:
Computer Science Dept., Technion, Haifa, Israel 32000
Venue:
Graph Theory, Computational Intelligence and Thought
Year:
2009

Citing 8
Cited 2

Domination on cocomparability graphs

SIAM Journal on Discrete Mathematics
Maximum weight independent sets and cliques in intersection graphs of filaments

Information Processing Letters
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Graphs and Hypergraphs

Graphs and Hypergraphs
Note: Note on maximal split-stable subgraphs

Discrete Applied Mathematics
Subtree filament graphs are subtree overlap graphs

Information Processing Letters
3D-interval-filament graphs

Discrete Applied Mathematics
Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science

Algorithms for induced biclique optimization problems

Information Processing Letters
Maximum induced multicliques and complete multipartite subgraphs in polygon-circle graphs and circle graphs

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.