Sciweavers

14 search results - page 1 / 3
» On the Facial Structure of the Common Edge Subgraph polytope
Sort
View
COLOGNETWENTE
2008
13 years 6 months ago
On the Facial Structure of the Common Edge Subgraph polytope
Gordana Manic, Laura Bahiense, Cid C. de Souza
IPCO
1996
121views Optimization» more  IPCO 1996»
13 years 6 months ago
Transitive Packing
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and th...
Rudolf Müller, Andreas S. Schulz
ISDA
2009
IEEE
13 years 11 months ago
Similarity Analysis of Protein Binding Sites: A Generalization of the Maximum Common Subgraph Measure Based on Quasi-Clique Dete
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...
Imen Boukhris, Zied Elouedi, Thomas Fober, Marco M...
ICPR
2004
IEEE
14 years 6 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero
SIAMDM
2008
119views more  SIAMDM 2008»
13 years 4 months ago
On the Graph Bisection Cut Polytope
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...