Sciweavers

3204 search results - page 251 / 641
» The Alcuin Number of a Graph
Sort
View
TVCG
2010
147views more  TVCG 2010»
15 years 5 months ago
"behaviorism": a framework for dynamic data visualization
— While a number of information visualization software frameworks exist, creating new visualizations, especially those that involve novel visualization metaphors, interaction tec...
Angus Forbes, Tobias Höllerer, George Legrady
WG
2010
Springer
15 years 5 months ago
Network Exploration by Silent and Oblivious Robots
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
Jérémie Chalopin, Paola Flocchini, B...
PODC
2011
ACM
14 years 9 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
ICALP
1995
Springer
15 years 10 months ago
Intervalizing k-Colored Graphs
The problem to determine whether a given k-colored graph is a subgraph of a properly colored interval graph has an application in DNA physical mapping. In this paper, we study the...
Hans L. Bodlaender, Babette de Fluiter
CIAC
2010
Springer
262views Algorithms» more  CIAC 2010»
15 years 10 months ago
Graph unique-maximum and conflict-free colorings
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
Panagiotis Cheilaris and Géza Tóth