Sciweavers

3268 search results - page 220 / 654
» The hub number of a graph
Sort
View
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
15 years 8 months ago
Scalable Name Disambiguation using Multi-level Graph Partition
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...
Byung-Won On, Dongwon Lee
DM
2008
72views more  DM 2008»
15 years 6 months ago
(p, 1)-Total labelling of graphs
A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
Frédéric Havet, Min-Li Yu
ASUNAM
2011
IEEE
14 years 6 months ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
16 years 1 days ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
JCO
2007
65views more  JCO 2007»
15 years 6 months ago
Group testing in graphs
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
Justie Su-tzu Juan, Gerard J. Chang