Sciweavers

3757 search results - page 183 / 752
» The overlap number of a graph
Sort
View
IUI
2011
ACM
14 years 9 months ago
Groups without tears: mining social topologies from email
As people accumulate hundreds of “friends” in social media, a flat list of connections becomes unmanageable. Interfaces agnostic to social structure hinder the nuanced sharin...
Diana MacLean, Sudheendra Hangal, Seng Keat Teh, M...
INFOVIS
2005
IEEE
16 years 1 days ago
Visualization of Graphs with Associated Timeseries Data
The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a vi...
Purvi Saraiya, Peter Lee, Chris North
DCOSS
2008
Springer
15 years 8 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
Andreas Wiese, Evangelos Kranakis
DM
2008
137views more  DM 2008»
15 years 6 months ago
Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
Let G = (V, E) be a graph. A set S V is a total restrained dominating set if every vertex is adjacent to a vertex in S and every vertex of V - S is adjacent to a vertex in V - S....
Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Jo...
COMBINATORICA
2010
15 years 3 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel