Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
type: Item
instance of: scholarly article
title: Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs
zbMATH Open document ID: 1326.05153
author: Fanica Gavril
published in: Journal of Discrete Algorithms
publication date: 2015-11-17T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6510086
zbMATH Keywords: graph algorithm
zbMATH Keywords: \(\mathcal{H}\)-mixed graph
zbMATH Keywords: subgraph overlap graph
zbMATH Keywords: subtree filament graph
zbMATH Keywords: maximum independent set
MaRDI profile type: Publication
full work available at URL: j.jda.2015.09.001
OpenAlex ID: W1921470280
cites work: A polynomial algorithm for the parity path problem on perfectly orientable graphs
cites work: On graphs with polynomially solvable maximum-weight clique problem
cites work: Induced matchings in intersection graphs.
cites work: Brambles and independent packings in chordal graphs
cites work: Independent packings in structured graphs
cites work: Maximum independent set and maximum clique algorithms for overlap graphs
cites work: Subtree filament graphs are subtree overlap graphs
cites work: Trapezoid graphs and generalizations, geometry and algorithms
cites work: Q3292914
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Intersection graphs of Helly families of subtrees
cites work: Maximum weight independent sets and cliques in intersection graphs of filaments
cites work: Algorithms on Subtree Filament Graphs
cites work: Algorithms for maximum weight induced paths
cites work: 3D-interval-filament graphs
cites work: Algorithms for induced biclique optimization problems
cites work: Algorithms on subgraph overlap graphs
cites work: Comparability graphs and intersection graphs
cites work: Partitioning chordal graphs into independent sets and cliques
cites work: Packing \(r\)-cliques in weighted chordal graphs
cites work: Thresholds for classes of intersection graphs
cites work: Covering and coloring polygon-circle graphs
cites work: Q4526776
cites work: Q4138414
cites work: Node-Deletion Problems on Bipartite Graphs
DOI: 10.1016/J.JDA.2015.09.001
description: scientific article; zbMATH DE number 6510086