4171 search results - page 258 / 835 » Choice numbers of graphs |
200
Voted
WORDS
2005
IEEE
16 years 9 days ago
2005
IEEE
Software metrics can be used to objectively quantify the quality of software components and systems, alleviating quality and risk concerns and raising assurance in component-based...
143
click to vote
COMBINATORICA
2006
15 years 6 months ago
2006
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
162
click to vote
ECEASST
2010
15 years 4 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
190
Voted
KDD
2008
ACM
16 years 7 months ago
2008
ACM
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...
195
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...