5889 search results - page 197 / 1178 » Graph Layout Problems |
171
click to vote
IANDC
2008
15 years 6 months ago
2008
We consider a permutation-based model for the gene assembly process in ciliates. We give a procedure to decide whether a given micronuclear molecules may be assembled by using onl...
156
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
192
click to vote
DAM
2000
15 years 6 months ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
206
click to vote
WADS
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
184
click to vote
AICCSA
2007
IEEE
16 years 22 days ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...