684 search results - page 61 / 137 » A characterization of b-perfect graphs |
103
click to vote
ENTCS
2008
15 years 1 months ago
2008
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
112
click to vote
SIGCOMM
2010
ACM
15 years 2 months ago
2010
ACM
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...
152
click to vote
AI
2011
Springer
14 years 9 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
140
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
110
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...