2310 search results - page 257 / 462 » Coloring Random Graphs |
172
click to vote
ISAAC
2005
Springer
16 years 1 days ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
188
click to vote
TSP
2008
15 years 6 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
194
click to vote
TCAD
2002
15 years 6 months ago
2002
The design of programmable logic architectures and supporting computer-aided design tools fundamentally requires both a good understanding of the combinatorial nature of netlist gr...
151
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
168
click to vote
SOFSEM
2007
Springer
16 years 20 days ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...