ALGORITHMS ON SUBGRAPH OVERLAP GRAPHS

DOI10.1142/S1793830914500189zbMath1307.05213OpenAlexW2064938171MaRDI QIDQ2875683

Fanica Gavril

Publication date: 11 August 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830914500189

zbMATH Keywords

polynomial time algorithmoverlap graphsubgraph filament graph

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Approximation algorithms for maximum weight k-coverings of graphs by packings ⋮ New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs ⋮ Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs ⋮ Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: ALGORITHMS ON SUBGRAPH OVERLAP GRAPHS