Sep 26, 2015 · A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the ...
Feb 16, 2015 · In this paper, we propose an algorithm, again linear in the output size, for a generalised caterpillar graph, where at each vertex of the ...
In this work, we determine the number of maximal independent sets (mis) in caterpillar graphs. For a general graph, this problem is
This paper proposes an algorithm, linear in the size of the output, for a generalised version of caterpillar graph, where at each vertex of the backbone, ...
Feb 16, 2015 · A caterpillar graph is a tree which on removal of all its pendant vertices leaves a chordless path. The chordless path is called the ...
In this paper, we propose an algorithm, again linear in the output size, for a generalised version of caterpillar graph, where at each vertex of the backbone, ...
In this work, we determine the number of maximal independent sets (mis) in caterpillar graphs. For a general graph, this problem is #P—complete. We provide a ...
Missing: generalisation | Show results with:generalisation
People also ask
How to find the maximum independent set in a graph?
How many maximal independent sets are there in triangle free graphs?
What is the maximum weight independent set in a graph?
What is a maximum independent set and a maximal independent set?
This paper proposes an algorithm, linear in the size of the output, for a generalised version of caterpillar graph, where at each vertex of the backbone, ...
In this work, we determine the number of maximal independent sets (mis) in caterpillar graphs. For a general graph, this problem is #P-complete.
Maximal independent sets in a generalisation of caterpillar graph. Neethi, K. S.; Saxena, S. Journal of Combinatorial Optimization 33(1): 326-332.