3204 search results - page 368 / 641 » The b-chromatic Number of a Graph |
189
click to vote
JDA
2006
15 years 6 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
199
click to vote
ENDM
2007
15 years 6 months ago
2007
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
180
click to vote
SOCIALCOM
2010
15 years 4 months ago
2010
It is a widely held belief among designers of social tagging systems that tag clouds represent a useful tool for navigation. This is evident in, for example, the increasing number ...
211
click to vote
FAST
2009
15 years 4 months ago
2009
Most application provenance systems are hard coded for a particular type of system or data, while current provenance file systems maintain in-memory provenance graphs and reside i...
200
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...