MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "Comment on "Computing the Shortest Network under a Fixed Topology"." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 757,854 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Computing Shortest Heterochromatic Monotone Routes  
  • by J. M. Díaz-báñez, G. Hernández, D. Oliveros, A. Ramírez-vigueras, J. A. Sellarès, I. Ventura
  • … Due to Excessive Length 1 Introduction Computing shortest paths in numerous geometrical scenarios is a…
  • Add To MetaCart
  • On degree constrained shortest paths  
  • by Samir Khuller, Kwangil Lee — 2005 — European Symposium on Algorithms (ESA
  • …. In addition, each vertex has a degree/interface constraint. We wish to compute a shortest path in the graph…
  • Cited by 1 (1 self) – Add To MetaCart
  • The shortest path to complex networks  
  • by S. N. Dorogovtsev, J. F. F. Mendes, Adjacency Matrix — 2004 — Am J Med Genet
  • …, these are maximally random networks under the constraint that the mean degree of their vertices, 〈k〉, is fixed. (We…
  • Cited by 4 (0 self) – Add To MetaCart
  • Shortest paths on dynamic graphs  
  • by Giacomo Nannicini, Leo Liberti — 2008
  • … for computing point-to-point shortest paths on large-scale road networks whose arcs are weighted with a…
  • Add To MetaCart
  • Topology  
  • by unknown authors
  • …Topology preserving linear filtering applied to medical imaging A. Buades A. Chien J.M. Morel S…
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB