3204 search results - page 361 / 641 » The b-chromatic Number of a Graph |
144
click to vote
SIAMDM
2000
15 years 6 months ago
2000
We show that the size of the smallest depth-two N-superconcentrator is (N log2 N/ log log N). Before this work, optimal bounds were known for all depths except two. For the upper b...
164
click to vote
JAL
2002
15 years 6 months ago
2002
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
188
click to vote
JGAA
1998
15 years 6 months ago
1998
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
201
click to vote
WABI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
250
click to vote
MP
2011
15 years 1 months ago
2011
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...