3105 search results - page 322 / 621 » The Path-Packing Structure of Graphs |
130
click to vote
PASTE
1998
ACM
15 years 9 months ago
1998
ACM
Static program slicing is an established method for analyzing sequential programs, especially for program understanding, debugging and testing. Until now, there was no slicing met...
145
click to vote
ASYNC
1997
IEEE
15 years 9 months ago
1997
IEEE
This paper introduces a novel technique for synthesis of speed-independent circuits from their Signal Transition Graph specifications. The new method uses partial order in the fo...
126
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
131
click to vote
ISSS
1995
IEEE
15 years 8 months ago
1995
IEEE
This paper examines the problem of code-generation for expression trees on non-homogeneous register set architectures. It proposes and proves the optimality of an O(n) algorithm f...
159
click to vote
AIRWEB
2008
Springer
15 years 6 months ago
2008
Springer
We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as we...