376 search results - page 28 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
CORR
2012
Springer
12 years 4 months ago
2012
Springer
Graphs and networks are used to model interactions in a variety of contexts, and there is a growing need to be able to quickly assess the qualities of a graph in order to understa...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
ISAAC
2004
Springer
14 years 2 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
NIPS
2007
13 years 10 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...