966 search results - page 59 / 194 » Small Alliances in Graphs |
SIROCCO
2001
13 years 10 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
DCG
2010
13 years 8 months ago
2010
Consider a graph G with n vertices. In this paper we study geometric conditions for an n-tuple of points in Rd to admit a non-zero self stress with underlying graph G. We introduce...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
INFOVIS
2005
IEEE
14 years 2 months ago
2005
IEEE
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...
AGTIVE
2003
Springer
14 years 1 months ago
2003
Springer
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...