656 search results - page 28 / 132 » Graph Theoretical Characterization and Computation of Answer... |
WWW
2006
ACM
14 years 8 months ago
2006
ACM
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
MFCS
2004
Springer
14 years 28 days ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
GC
2007
Springer
13 years 7 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...