1493 search results - page 158 / 299 » Local resilience of graphs |
90
Voted
SIAMCOMP
2008
15 years 1 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
114
click to vote
IJICT
2007
15 years 1 months ago
2007
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...
97
Voted
JCT
2007
15 years 29 days ago
2007
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
117
click to vote
CORR
2007
Springer
15 years 19 days ago
2007
Springer
7 Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of pa...
IFIP
2009
Springer
14 years 10 months ago
2009
Springer
We present a platform that allows a protocol researcher to specify the sequence of games from an initial protocol to a protocol where the security property under consideration can ...