25 search results - page 1 / 5 » Locating Median Paths on Connected Outerplanar Graphs |
COLOGNETWENTE
2008
13 years 6 months ago
2008
WG
2000
Springer
13 years 8 months ago
2000
Springer
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we address graph-theoretic problems t...
DM
1998
13 years 4 months ago
1998
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
GD
2009
Springer
13 years 9 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
BMCBI
2008
13 years 4 months ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...