2398 search results - page 438 / 480 » Constraint Programming and Graph Algorithms |
122
click to vote
NRHM
2008
15 years 4 months ago
2008
Overlapping markup refers to the issue of how to represent data structures more expressive than trees--for example direct acyclic graphs--using markup (meta-)languages which have ...
126
click to vote
NETWORKS
2010
15 years 2 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
151
click to vote
OOPSLA
2010
Springer
15 years 2 months ago
2010
Springer
The usage of optimistic version control systems comes along with cumbersome and time-consuming conflict resolution in the case that the modifications of two developers are contrad...
156
click to vote
SPIRE
2010
Springer
15 years 2 months ago
2010
Springer
Next generation sequencing (NGS) technologies are being applied to many fields of biology, notably to survey the polymorphism across individuals of a species. However, while single...
158
click to vote
COLOGNETWENTE
2010
15 years 1 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...