-
Prisacaru &
Chepoi (1992);
Dragan (1993) Brandstädt,
Chepoi &
Dragan (1998);Dragan (1989) Brandstädt,
Chepoi &
Dragan (1998); Dragan,
Prisacaru &
Chepoi (1992);...
-
graphs have
related definitions involving metric embeddings (Bandelt &
Chepoi 2008). A flip
graph is a
graph formed from the
triangulations of a point...
- in more
general planar or
median graphs; for instance,
Chepoi,
Dragan & Vaxès (2002) and
Chepoi,
Fanciullini & Vaxès (2004)
present linear time algorithms...
-
surveys of
median graphs are
given by Klavžar &
Mulder (1999),
Bandelt &
Chepoi (2008), and
Knuth (2008).
Every tree is a
median graph. To see this, observe...
- give
earlier weaker bounds on the same problem.
Ageev (1999). Bandelt,
Chepoi &
Eppstein (2010).
Naveed Sherwani, "Algorithms for VLSI
Physical Design...
-
Kempe containing a
false proof of the four
color theorem. Bandelt, H.-J.;
Chepoi, V.; Eppstein, D. (2010), "Combinatorics and
geometry of
finite and infinite...
-
injective object in the
category of
metric spaces and
metric maps. See e.g.
Chepoi 1997.
Aronszajn &
Panitchpakdi 1956. Sine 1979;
Soardi 1979. For additional...
- MR 1441972. Weisstein, Eric W. "Gear graph". MathWorld. Bandelt, H.-J.;
Chepoi, V.; Eppstein, D. (2010), "Combinatorics and
geometry of
finite and infinite...
-
independently rediscovered by
Dress (1984) and
Chrobak &
Larmore (1994); see
Chepoi (1997) for this history. The
tight span is one of the
central constructions...
- For
related results involving shortest paths instead of
induced paths see
Chepoi (1986) and
Bandelt &
Pesch (1989).
Clarkson et al. (1996). Bajmóczy, E....
