1172 search results - page 123 / 235 » Path Algorithms on Regular Graphs |
119
Voted
SIGSOFT
2003
ACM
16 years 1 months ago
2003
ACM
This paper presents a novel approach for automated test data generation of imperative programs containing integer, boolean and/or float variables. It extends our previous work to ...
136
click to vote
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
96
Voted
SIAMDM
2008
15 years 15 days ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
88
Voted
SIAMCOMP
2008
15 years 15 days 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. ...
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...