Sciweavers

296 search results - page 18 / 60
» Group connectivity of certain graphs
Sort
View
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
12 years 11 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
FOCS
2002
IEEE
14 years 17 days ago
Global Information from Local Observation
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
Itai Benjamini, László Lovász
IUI
2009
ACM
14 years 2 months ago
Discovering frequent work procedures from resource connections
Intelligent desktop assistants could provide more help for users if they could learn models of the users’ workflows. However, discovering desktop workflows is difficult becau...
Jianqiang Shen, Erin Fitzhenry, Thomas G. Dietteri...
IWPC
2002
IEEE
14 years 16 days ago
Slicing Aspect-Oriented Software
Program slicing has many applications in software engineering activities including program comprehension, debugging, testing, maintenance, and model checking. In this paper, we pr...
Jianjun Zhao
DM
2007
59views more  DM 2007»
13 years 7 months ago
Non-existence of nonorientable regular embeddings of n-dimensional cubes
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
Young Soo Kwon, Roman Nedela