Sciweavers

3008 search results - page 58 / 602
» Independence in connected graphs
Sort
View
IPPS
2009
IEEE
16 years 28 days ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 10 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
MM
2010
ACM
151views Multimedia» more  MM 2010»
15 years 6 months ago
Explicit and implicit concept-based video retrieval with bipartite graph propagation model
The major scientific problem for content-based video retrieval is the semantic gap. Generally speaking, there are two appropriate ways to bridge the semantic gap: the first one is...
Lei Bao, Juan Cao, Yongdong Zhang, Jintao Li, Ming...
CORR
2012
Springer
194views Education» more  CORR 2012»
14 years 2 months ago
A Graph Theoretical Approach to Network Encoding Complexity
Consider an acyclic directed network G with sources S1, S2, . . . , Sl and distinct sinks R1, R2, . . . , Rl. For i = 1, 2, . . . , l, let ci denote the min-cut between Si and Ri....
Li Xu, Weiping Shang, Guangyue Han
IANDC
2008
85views more  IANDC 2008»
15 years 6 months ago
Monotony properties of connected visible graph searching
Search games are attractive for their correspondence with classical width parameters. For instance, the invisible search number (a.k.a. node search number) of a graph is equal to
Pierre Fraigniaud, Nicolas Nisse