230 search results - page 28 / 46 » Time Varying Undirected Graphs |
113
click to vote
STACS
2007
Springer
15 years 5 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
108
click to vote
SOFTVIS
2003
ACM
15 years 4 months ago
2003
ACM
An active research area in telecommunications concerns how to specify and control the addition of new services, such as call waiting or instant messaging, into existing software. ...
ACSC
2004
IEEE
15 years 3 months ago
2004
IEEE
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...
105
click to vote
PODC
2006
ACM
15 years 5 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
SODA
1997
ACM
15 years 27 days ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...