Sciweavers

773 search results - page 10 / 155
» Traversing the Machining Graph
Sort
View
FSTTCS
2000
Springer
15 years 3 months ago
Planar Graph Blocking for External Searching
We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves th...
Surender Baswana, Sandeep Sen
97
Voted
SIGSOFT
1994
ACM
15 years 3 months ago
A New Model of Program Dependences for Reverse Engineering
A dependence model for reverse engineering should treat procedures in a modular fashion and should be fine-grained, distinguishing dependences that are due to different variables....
Daniel Jackson, Eugene J. Rollins
ENDM
2008
90views more  ENDM 2008»
14 years 11 months ago
On cliques of Helly Circular-arc Graphs
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...
Min Chih Lin, Ross M. McConnell, Francisco J. Soul...
ICML
2009
IEEE
16 years 14 days ago
Fitting a graph to vector data
Samuel I. Daitch, Jonathan A. Kelner, Daniel A. Sp...