Sciweavers

592 search results - page 66 / 119
» Crossing numbers of random graphs
Sort
View
TOMS
2010
106views more  TOMS 2010»
13 years 6 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
14 years 2 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
JAIR
2007
106views more  JAIR 2007»
13 years 8 months ago
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins...
J. Christopher Beck
GLOBECOM
2009
IEEE
13 years 12 months ago
Stochastic Properties and Application of City Section Mobility Model
Abstract--Node mobility has a direct impact on the performance evaluation of various network mobility protocols. Unfortunately, most of the analysis on mobility protocols used Rand...
Md. Shohrab Hossain, Mohammed Atiquzzaman
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
13 years 6 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang