1986 search results - page 211 / 398 » Path Separability of Graphs |
108
click to vote
NETWORKS
2002
15 years 2 months ago
2002
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...
128
click to vote
WEBI
2010
Springer
15 years 8 days ago
2010
Springer
Mobile is becoming a ubiquitous platform for context-aware intelligent computing. One fundamental but usually ignored issue is how to efficiently manage (e.g., index and query) the...
124
click to vote
AGTIVE
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we will define a custom term-graph reduction system for a simplified lazy functional language. Our custom system is geared towards flexibility, which is accomplis...
133
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
124
Voted
PPDP
2009
Springer
15 years 9 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...