3471 search results - page 299 / 695 » Obstacle Numbers of Graphs |
358
click to vote
CSL
2011
Springer
15 years 1 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...
163
click to vote
DM
2007
15 years 6 months 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...
169
Voted
SIAMDM
2010
15 years 5 months ago
2010
Reed conjectured that for every ε > 0 and every integer ∆, there exists g such that the fractional total chromatic number of every graph with maximum degree ∆ and girth at...
264
Voted
SIGMOD
2007
ACM
16 years 6 months 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 ...
169
click to vote
CIKM
2009
Springer
16 years 1 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...