Sciweavers

9532 search results - page 350 / 1907
» Logic, Graphs, and Algorithms
Sort
View
174
Voted
SIGCOMM
1992
ACM
15 years 10 months ago
Internet Routing Over Large Public Data Networks Using Shortcuts
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
Paul F. Tsuchiya
DLOG
2011
14 years 10 months ago
Extracting Finite Sets of Entailments from OWL Ontologies
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...
Samantha Bail, Bijan Parsia, Ulrike Sattler
SOFSEM
2009
Springer
16 years 3 months ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...
137
Voted
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
16 years 27 days ago
Good Quality Virtual Realization of Unit Ball Graphs
Sriram V. Pemmaraju, Imran A. Pirwani
COCO
2005
Springer
79views Algorithms» more  COCO 2005»
16 years 8 days ago
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy
Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaragh...