Sciweavers

2503 search results - page 44 / 501
» A study of 3-arc graphs
Sort
View
SOFSEM
2009
Springer
16 years 2 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...
TAMC
2009
Springer
16 years 11 days ago
Best-Order Streaming Model
We study a new model of computation called stream checking on graph problems where a space-limited verifier has to verify a proof sequentially (i.e., it reads the proof as a strea...
Atish Das Sarma, Richard J. Lipton, Danupon Nanong...
SEMWEB
2007
Springer
15 years 12 months ago
Understanding the Semantics of Ambiguous Tags in Folksonomies
The use of tags to describe Web resources in a collaborative manner has experienced rising popularity among Web users in recent years. The product of such activity is given the nam...
Ching-man Au Yeung, Nicholas Gibbins, Nigel Shadbo...
VL
2005
IEEE
107views Visual Languages» more  VL 2005»
15 years 11 months ago
Navigating Software Architectures with Constant Visual Complexity
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
Wanchun Li, Peter Eades, Seok-Hee Hong
IV
2003
IEEE
116views Visualization» more  IV 2003»
15 years 11 months ago
Visualization of Semantic Metadata and Ontologies
Implicit information embedded in semantic web graphs, such as topography, clusters, and disconnected subgraphs is difficult to extract from text files. Visualizations of the graph...
Paul Mutton, Jennifer Golbeck