2137 search results - page 222 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
189
click to vote
IPL
2010
15 years 1 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
156
Voted
GD
1998
Springer
15 years 10 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
159
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
207
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
158
click to vote
JGAA
2000
15 years 6 months ago
2000
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...