3356 search results - page 57 / 672 » Determining Consensus Numbers |
125
Voted
GC
2007
Springer
15 years 2 months ago
2007
Springer
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...
132
Voted
DAM
1999
15 years 2 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
114
click to vote
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
We consider the problem of source number estimation in array processing when impulsive noise is present. To combat impulsive noise more effectively, two robust estimators with hig...
106
click to vote
COMPGEOM
2005
ACM
15 years 4 months ago
2005
ACM
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
105
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
Given an integer s 0 and a permutation Sn, let ,s be the graph on n vertices {1, . . . , n} where two vertices i < j are adjacent if the permutation flips their order and th...