Algorithms on Subtree Filament Graphs
DOI10.1007/978-3-642-02029-2_3zbMATH Open1194.05144OpenAlexW1520704862MaRDI QIDQ3655136FDOQ3655136
Authors: Fanica Gavril 
Publication date: 7 January 2010
Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02029-2_3
Recommendations
- Arboricity and Subgraph Listing Algorithms
- Algorithms on subgraph overlap graphs
- scientific article; zbMATH DE number 1820633
- scientific article; zbMATH DE number 902730
- scientific article; zbMATH DE number 1323192
- Subgraph trees in graph theory
- Arboricity and bipartite subgraph listing algorithms
- Sublinear graph approximation algorithms
- Subtrees and subforests of graphs
- scientific article; zbMATH DE number 1031380
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Comparability graphs and intersection graphs
- Domination on Cocomparability Graphs
- Algorithms on circular-arc graphs
- The strong perfect graph theorem
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Title not available (Why is that?)
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Title not available (Why is that?)
- Induced matchings in intersection graphs.
- Subtree filament graphs are subtree overlap graphs
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete
- 3D-interval-filament graphs
- Note on maximal split-stable subgraphs
Cited In (9)
- Trees with the mos subtrees - an algorithmic approach
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected
- Approximation algorithms for maximum weight k-coverings of graphs by packings
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs
- Maximum max-k-clique subgraphs in cactus subtree graphs
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
- Subsumption algorithms based on search trees
- Algorithms for induced biclique optimization problems
- Algorithms on subgraph overlap graphs
This page was built for publication: Algorithms on Subtree Filament Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3655136)
