540 search results - page 35 / 108 » New bounds on the edge number of a k-map graph |
COCOON
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...
WG
2005
Springer
14 years 2 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 ...
SPAA
2006
ACM
14 years 2 months ago
2006
ACM
Synchronization is often necessary in parallel computing, but it can create delays whenever the receiving processor is idle, waiting for the information to arrive. This is especia...
ALGORITHMICA
2010
13 years 9 months ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
ESCAPE
2007
Springer
14 years 21 days ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...