3211 search results - page 386 / 643 » On the Grundy Number of a Graph |
170
click to vote
EUROPAR
2004
Springer
16 years 1 days ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
145
click to vote
FOCS
2003
IEEE
15 years 12 months ago
2003
IEEE
We initiate a general study of pseudo-random implementations of huge random objects, and apply it to a few areas in which random objects occur naturally. For example, a random obj...
220
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
150
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
196
click to vote
ICSE
1999
IEEE-ACM
15 years 11 months ago
1999
IEEE-ACM
In this paper we show how the FLAVERS data flow analysis technique, originally formulated for programs with the rendezvous model of concurrency, can be applied to concurrent Java...