optimal way in graph?

From: CC.TUDresden@xxxxxxxxx
Date: 25 Aug 2006 03:08:37 -0700

want to find a way from a start vertice to visit the other vertices in
a graph.
constraints:
1. a way with min. edges
2. need not to visit all the vertices of this graph, but the unvisit
vertices should have max. 2 edges to one of the visited vertices on
this way

.

Follow-Ups:
- Re: optimal way in graph?
  - From: berndlosert

Prev by Date: Question about the relationship between the eigenvalues of graph and its subgraph
Next by Date: Shortest path with intermediate nodes algorithm
Previous by thread: Question about the relationship between the eigenvalues of graph and its subgraph
Next by thread: Re: optimal way in graph?
Index(es):
- Date
- Thread