1172 search results - page 122 / 235 » Path Algorithms on Regular Graphs |
174
click to vote
MOBICOM
2012
ACM
13 years 7 months ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
149
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
167
click to vote
SODA
2012
ACM
13 years 7 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
140
Voted
TON
2008
15 years 4 months ago
2008
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
155
click to vote
DASFAA
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract. Privacy becomes a major concern for both customers and enterprises in today’s corporate marketing strategies, many research efforts have been put into developing new p...