106 search results - page 14 / 22 » Edge clique graphs and some classes of chordal graphs |
102
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
COMGEO
2010
ACM
14 years 11 months ago
2010
ACM
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...
DAM
2011
14 years 6 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
112
click to vote
SIROCCO
2007
15 years 1 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
101
click to vote
WG
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...