1986 search results - page 248 / 398 » Path Separability of Graphs |
158
click to vote
WAOA
2005
Springer
15 years 9 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
131
Voted
CGO
2003
IEEE
15 years 7 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
147
Voted
TACAS
2010
Springer
15 years 1 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
108
Voted
SIROCCO
2010
15 years 5 months ago
2010
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
166
Voted
KIVS
2011
Springer
14 years 6 months ago
2011
Springer
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...