1327 search results - page 153 / 266 » Path following algorithm for the graph matching problem |
123
Voted
GCB
2004
Springer
15 years 9 months ago
2004
Springer
: To facilitate research in comparative genomics, sequencing projects are increasingly aimed at assembling the genomes of closely related organisms. Given two incomplete assemblies...
132
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
173
click to vote
BIOINFORMATICS
2008
15 years 4 months ago
2008
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
128
Voted
ISAAC
1995
Springer
15 years 7 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
125
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...