1729 search results - page 112 / 346 » Bound Graph Polysemy |
163
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
151
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
141
click to vote
DM
2008
15 years 5 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
168
click to vote
JCP
2008
15 years 5 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
149
click to vote
CORR
2012
Springer
14 years 26 days ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...