796 search results - page 126 / 160 » Graph Properties Based Filtering |
82
Voted
COCO
2010
Springer
15 years 1 months ago
2010
Springer
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
ICSE
1995
IEEE-ACM
15 years 1 months ago
1995
IEEE-ACM
This paper presents a compact Petri net representation that is e cient to construct for concurrent programs that use explicit tasking and rendezvous style communication. These Pet...
88
Voted
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
ENTCS
2008
14 years 9 months ago
2008
We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational se...
88
Voted
JDA
2006
14 years 9 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...