684 search results - page 74 / 137 » A characterization of b-perfect graphs |
ICALP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
100
click to vote
ANOR
2005
14 years 11 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
118
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
107
click to vote
FM
2006
Springer
15 years 3 months ago
2006
Springer
Formal modeling is a crucial first step in the analysis of safety critical communication protocols such as IP Telephony. These protocols are notoriously resistant to formal modelin...
102
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...