3471 search results - page 423 / 695 » Obstacle Numbers of Graphs |
170
click to vote
WALCOM
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract. Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations...
198
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
187
click to vote
ISPASS
2009
IEEE
16 years 1 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
167
click to vote
SP
2009
IEEE
16 years 1 months ago
2009
IEEE
Operators of online social networks are increasingly sharing potentially sensitive information about users and their relationships with advertisers, application developers, and da...
206
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...