1963 search results - page 101 / 393 » The Maximum Solution Problem on Graphs |
92
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The observation and modeling of natural Complex Systems (CSs) like the human nervous system, the evolution or the weather, allows the definition of special abilities and models re...
92
Voted
APPML
2008
15 years 2 months ago
2008
In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimiz...
137
Voted
CATS
2008
15 years 4 months ago
2008
In this paper we consider a problem that occurs when drawing public transportation networks. Given an embedded graph G = (V, E) (e.g. the railroad network) and a set H of paths in...
122
click to vote
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
150
Voted
IPCO
2008
15 years 4 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...