Search Results - "Chepoi, Victor D."

Additive sparse spanners for graphs with bounded length of largest induced cycle by Chepoi, Victor D., Dragan, Feodor F., Yan, Chenyu

“…In this paper, we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2 n - 2 edges and an additive 3-spanner…”
Get full text

Perfect elimination orderings of chordal powers of graphs by Brandstädt, Andreas, Chepoi, Victor D., Dragan, Feodor F.

“…Let G = ( V, E) be a finite undirected connected graph. We show that there is a common perfect elimination ordering of all powers of G which represent chordal…”
Get full text

The algorithmic use of hypertree structure and maximum neighbourhood orderings by Brandstädt, Andreas, Chepoi, Victor D., Dragan, Feodor F.

“…The use of (generalized) tree structure in graphs is one of the main topics in the field of efficient graph algorithms. The well-known partial k-tree (resp…”
Get full text