Sciweavers

1056 search results - page 153 / 212
» Constraint-Based Graph Matching
Sort
View
FOCS
2003
IEEE
14 years 2 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
PODS
2010
ACM
213views Database» more  PODS 2010»
14 years 2 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
WEBDB
2010
Springer
143views Database» more  WEBDB 2010»
14 years 2 months ago
Querying Wikipedia Documents and Relationships
Wikipedia has become an important source of information which is growing very rapidly. However, the existing infrastructure for querying this information is limited and often igno...
Huong Nguyen, Thanh Nguyen, Hoa Nguyen, Juliana Fr...
PODC
2010
ACM
14 years 29 days ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
IPPS
2000
IEEE
14 years 20 days ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch