Sciweavers

3267 search results - page 286 / 654
» Generalized quasirandom graphs
Sort
View
DM
2008
115views more  DM 2008»
15 years 6 months ago
Characterizations of postman sets
Using results by McKee and Woodall on binary matroids, we prove that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eu...
Néstor E. Aguilera, Valeria A. Leoni
JEA
2010
95views more  JEA 2010»
15 years 5 months ago
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
In recent years, highly effective hierarchical and goal-directed speedup techniques for routing in large road networks have been developed. This paper makes a systematic study of ...
Reinhard Bauer, Daniel Delling, Peter Sanders, Den...
IPMU
2010
Springer
15 years 4 months ago
Possibilistic Graphical Models and Compositional Models
We overview three kinds of possibilistic graphical models (based on directed acyclic graphs) and present, how they can be expressed by means of non-graphical approach to multidimen...
Jirina Vejnarová
ICPR
2004
IEEE
16 years 8 months ago
Towards Surface Regularization via Medial Axis Transitions
The reconstruction of objects from data in practical applications often leads to surfaces with small perturbations and other artifacts which make the detection of their ridges and...
Frederic F. Leymarie, Benjamin B. Kimia, Peter J. ...
SIGSOFT
2003
ACM
16 years 7 months ago
Context-sensitive slicing of concurrent programs
Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent prog...
Jens Krinke