Titlebook: ;

Facilities

https://doi.org/10.1007/978-3-030-19019-4We consider the following problem, called .. Given a graph . which is a subgraph of the chordal graph .; compute an inclusion minimal chordal graph . = (.), such that .. We show that this can be done in .(.) time. This extends the results of [2]. The algorithm is also simpler and is based only on well known results on chordal graphs.

GLOOM

defile

Mediocre

LASH

Suresh I. S. Rattan,Olivier Toussainton a previously known structure theorem which decomposes a graph into its ..-connected components and on a new decomposition theorem for ..-connected graphs. As a final result we obtain a tree representation for arbitrary graphs which is unique to isomorphism.

Tractable

anesthesia

Facilities

Project

-completeness results for minimum planar spanners, 5. We thus extend results on that problem to the interesting case where the instances are known to be planar. We also introduce the related problem of finding minimum .-spanners and establish its .-hardness for similar fixed values of ..

initiate