1729 search results - page 74 / 346 » Bound Graph Polysemy |
123
Voted
DM
2006
15 years 5 months ago
2006
In 1985, Erdos and Ne
135
click to vote
CPC
2008
15 years 5 months ago
2008
A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker's aim is to claim a c...
137
click to vote
DM
1999
15 years 4 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
146
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
120
Voted
CSL
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. It it shown that the first-order theory of an automatic structure, whose Gaifman graph has bounded degree, is decidable in doubly exponential space (for injective automa...