3204 search results - page 234 / 641 » The b-chromatic Number of a Graph |
106
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
230
Voted
CSL
2011
Springer
14 years 7 months ago
2011
Springer
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...
94
Voted
DM
2007
15 years 19 days ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
179
Voted
SIGMOD
2007
ACM
16 years 25 days ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
101
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...