Polynomial time algorithms for the k-in-a-tree problem for k ≥ 4 are known only for the restricted cases of claw-free graphs, by Fiala et al. [6], and graphs ...
Apr 28, 2018 · In this paper we give a O ( n m 2 ) \mathcal{O}(nm^2) time algorithm for the k-in-a-tree problem for chordal graphs, even in the case where k is ...
Oct 22, 2024 · In this paper we give a O(nm 2) time algorithm for the kin a tree problem for chordal graphs, even in the case where k is part of the input.
Jan 25, 2020 · I would like to find some basic/early algorithms for finding a clique of certain size in a graph, in particular regular graph but general graph is also fine.
Missing: chordal | Show results with:chordal
Jun 15, 2020 · On the time complexity front, chordal graphs can be recognized in polynomial time [[11], [24]]. Like chordal graphs, a related graph class, ...
In this problem k pairs of vertices are to be connected by pairwise vertex-disjoint paths. We also present the first polynomial-time algorithm for chordal ...
This problem is solvable in polynomial time for interval graphs [2], but it. is not known whether a polynomial time algorithm exists for chordal graphs. The ...
Oct 15, 2023 · There are many problems that are NP-hard on large graph classes that become polynomial time solvable on chordal graphs, for example treewidth, ...
In this paper, we prove that for any graph G and an integer k ≥ 3, we can find, in |V(G)|2 time, either an induced cycle larger than k or a tree-decomposition ...
The graph sandwich problem on chordal graphs is NP-complete whereas the probe graph problem on chordal graphs has polynomial-time complexity. The ...