Sciweavers

335 search results - page 65 / 67
» How to Use Spanning Trees to Navigate in Graphs
Sort
View
NRHM
2008
106views more  NRHM 2008»
14 years 11 months ago
Towards the unification of formats for overlapping markup
Overlapping markup refers to the issue of how to represent data structures more expressive than trees--for example direct acyclic graphs--using markup (meta-)languages which have ...
Paolo Marinelli, Fabio Vitali, Stefano Zacchiroli
IPPS
1998
IEEE
15 years 4 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
Sven Venema, Hong Shen, Francis Suraweera
RECOMB
2006
Springer
16 years 4 hour ago
A Parameterized Algorithm for Protein Structure Alignment
This paper proposes a parameterized algorithm for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a ...
Jinbo Xu, Feng Jiao, Bonnie Berger
CN
2006
70views more  CN 2006»
14 years 11 months ago
Small-world characteristics of Internet topologies and implications on multicast scaling
Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Int...
Shudong Jin, Azer Bestavros
SMA
1999
ACM
106views Solid Modeling» more  SMA 1999»
15 years 4 months ago
Resolving non-uniqueness in design feature histories
Nearly all major commercial computer-aided design systems have adopted a feature-based design approach to solid modeling. Models are created via a sequence of operations which app...
Vincent A. Cicirello, William C. Regli