3204 search results - page 196 / 641 » The b-chromatic Number of a Graph |
ECEASST
2010
13 years 8 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...
KDD
2008
ACM
14 years 11 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...
FOCS
2009
IEEE
14 years 5 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...
CIKM
2009
Springer
14 years 5 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
COCOON
2003
Springer
14 years 3 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...