1447 search results - page 166 / 290 » Graphs and Path Equilibria |
124
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Non-adaptive group testing involves grouping arbitrary subsets of n items into different pools. Each pool is then tested and defective items are identified. A fundamental question...
140
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
151
click to vote
WG
1994
Springer
15 years 8 months ago
1994
Springer
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
131
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Many applications, including provenance and some analyses of social networks, require path-based queries over graphstructured data. When these graphs contain sensitive information...
145
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...