396 search results - page 51 / 80 » Exact Algorithms for Graph Homomorphisms |
ICPP
2006
IEEE
14 years 3 months ago
2006
IEEE
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— We focus on efficient protocols that enhance a network with topology awareness. We discuss centralized algorithms with provable performance, and introduce decentralized asynch...
DGCI
2009
Springer
14 years 8 days ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
FSTTCS
2008
Springer
13 years 10 months ago
2008
Springer
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by ...