Sciweavers

3204 search results - page 176 / 641
» The Alcuin Number of a Graph
Sort
View
GLVLSI
2002
IEEE
109views VLSI» more  GLVLSI 2002»
14 years 1 months ago
Minimizing resources in a repeating schedule for a split-node data-flow graph
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
Timothy W. O'Neil, Edwin Hsing-Mean Sha
ICALP
2010
Springer
14 years 1 months ago
Dynamic Programming for Graphs on Surfaces
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
14 years 19 days 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
SIAMDM
2010
114views more  SIAMDM 2010»
13 years 6 months ago
Rank-Based Attachment Leads to Power Law Graphs
Abstract. We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according ...
Jeannette Janssen, Pawel Pralat
MST
2011
209views Hardware» more  MST 2011»
13 years 3 months ago
Spreading of Messages in Random Graphs
Chang and Lyuu [Chang and Lyuu, 2008] study the spreading of a message in an Erd˝os-R´enyi random graph G(n, p) starting from a set of vertices that are convinced of the message...
Ching-Lueh Chang, Yuh-Dauh Lyuu