2612 search results - page 33 / 523 » Switching Graphs and Their Complexity |
DAC
2000
ACM
14 years 10 months ago
2000
ACM
PAKDD
2010
ACM
14 years 2 months ago
2010
ACM
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
JCST
2010
13 years 4 months ago
2010
With recent efforts to build foundational certified software systems, two different approaches have been proposed to certify thread context switching. One is to certify both thread...
AAIM
2005
Springer
14 years 3 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...