4913 search results - page 222 / 983 » Results and Perspectives of the G |
153
click to vote
PODC
2006
ACM
16 years 17 days ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
159
click to vote
FCT
2005
Springer
16 years 4 days ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
187
click to vote
DNA
2006
Springer
15 years 10 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
214
click to vote
FSTTCS
2010
Springer
15 years 4 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...
189
click to vote
ITICSE
2004
ACM
16 years 1 days ago
2004
ACM
With our interest to improve our education in computer science, an understanding of how students learn about CS concepts, how different concepts are understood, as well as the con...