Sciweavers

154 search results - page 8 / 31
» Odd subgraphs and matchings
Sort
View
IPCO
1996
121views Optimization» more  IPCO 1996»
13 years 11 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
WG
2010
Springer
13 years 7 months ago
From Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
Steven Chaplick, Marisa Gutierrez, Benjamin L&eacu...
EJC
2010
13 years 9 months ago
Perfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
Tomás Kaiser, André Raspaud
IPL
2008
104views more  IPL 2008»
13 years 9 months ago
A note on harmonic subgraphs in labelled geometric graphs
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
Gabriela Araujo, József Balogh, Ruy Fabila ...
ISDA
2009
IEEE
14 years 4 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...