2283 search results - page 245 / 457 » Bounds of Graph Characteristics |
200
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
242
click to vote
FSTTCS
2010
Springer
15 years 5 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
231
click to vote
SIGCOMM
1992
ACM
15 years 11 months ago
1992
ACM
This paper considers the support of real-time applications in an Integrated Services Packet Network (ISPN). We rst review the characteristics of real-time applications. We observ...
160
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
194
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...