The type Add allows to extend the ends of the paths while the type Sub allows to expand the middle of the path. The difference occurs when an endpoint of the ...

Chordal graphs are intersection graphs of subtrees in a tree. We investigate complexity of the partial representation extension problem for chordal graphs.

Jul 1, 2012 · It asks whether it is possible to construct a representation inside a modified tree T which extends the partial representation (i.e, keeps the ...

In this paper, we have considered different problems concerning extending partial representations of chordal graphs and their three subclasses. One of the ...

What is a partial representation of a chordal graph? R′ gives some tree T′ which is modified in R to T: • FIXED: the tree T′ can not be modified, T = T′.

Abstract. Chordal graphs are intersection graphs of subtrees in a tree. We investigate complexity of the partial representation extension prob-.

Chordal graphs are intersection graphs of subtrees of a tree T. We investigate the complexity of the partial representation extension problem for chordal ...

We present the first dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether ...

Chordal graphs are intersection graphs of subtrees of a tree T. We investigate the complexity of the partial representation extension problem for chordal ...

Chordal graphs are intersection graphs of subtrees of a tree T . We investigate the complexity of the partial representation extension problem for chordal ...