Algorithms for GA- H reduced graphs
DOI10.1016/J.JDA.2015.09.001zbMATH Open1326.05153OpenAlexW1921470280MaRDI QIDQ891818FDOQ891818
Authors: Fanica Gavril 
Publication date: 17 November 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2015.09.001
Recommendations
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs
- Approximation algorithms for maximum weight k-coverings of graphs by packings
- Maximum weight independent sets and cliques in intersection graphs of filaments
- 3D-interval-filament graphs
- Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
graph algorithmmaximum independent set\(\mathcal{H}\)-mixed graphsubgraph overlap graphsubtree filament graph
Graph algorithms (graph-theoretic aspects) (05C85) 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
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Node-Deletion Problems on Bipartite Graphs
- Title not available (Why is that?)
- Algorithms for maximum weight induced paths
- Thresholds for classes of intersection graphs
- Partitioning chordal graphs into independent sets and cliques
- Intersection graphs of Helly families of subtrees
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Trapezoid graphs and generalizations, geometry and algorithms
- Title not available (Why is that?)
- Induced matchings in intersection graphs.
- On graphs with polynomially solvable maximum-weight clique problem
- Covering and coloring polygon-circle graphs
- Independent packings in structured graphs
- Maximum independent set and maximum clique algorithms for overlap graphs
- Subtree filament graphs are subtree overlap graphs
- Packing \(r\)-cliques in weighted chordal graphs
- Brambles and independent packings in chordal graphs
- A polynomial algorithm for the parity path problem on perfectly orientable graphs
- Algorithms for induced biclique optimization problems
- 3D-interval-filament graphs
- Algorithms on subgraph overlap graphs
- Algorithms on Subtree Filament Graphs
Cited In (4)
This page was built for publication: Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891818)
