Thresholds for classes of intersection graphs
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
An O(n2) algorithm for undirected split decomposition
Journal of Algorithms
Chordless paths, odd holes, and kernels in graphs without m-obstructions
Journal of Algorithms
Intersection graphs of Helly families of subtrees
Discrete Applied Mathematics
Proceedings of an international symposium on Graphs and combinatorics
Trapezoid graphs and generalizations, geometry and algorithms
Discrete Applied Mathematics
Maximum weight independent sets and cliques in intersection graphs of filaments
Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Spanners for bounded tree-length graphs
Theoretical Computer Science
Discrete Applied Mathematics
Note: An improved algorithm for the longest induced path problem on k-chordal graphs
Discrete Applied Mathematics
| Hi-index | 0.89 |
A family of graphs is a k-bounded-hole family if every graph in the family has no holes with more than k vertices. The problem of finding in a graph a maximum weight induced path has applications in large communication and neural networks when worst case communication time needs to be evaluated; unfortunately this problem is NP-hard even when restricted to bipartite graphs. We show that this problem has polynomial time algorithms for k-bounded-hole families of graphs, for interval-filament graphs and for graphs decomposable by clique cut-sets or by splits into prime subgraphs for which such algorithms exist.