175 search results - page 12 / 35 » max-cut and Containment Relations in Graphs |
COMBINATORICS
2004
13 years 8 months ago
2004
The basic functional equations for connected and 2-connnected graphs can be traced back to the statistical physicists Mayer and Husimi. They play an essential role in establishing...
SIAMDM
2010
13 years 3 months ago
2010
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
ENDM
2008
13 years 8 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
IV
2009
IEEE
14 years 3 months ago
2009
IEEE
A lexical network is a very useful resource for natural language processing systems. However, building high quality lexical networks is a complex task. “Jeux de mots” is a web...