684 search results - page 68 / 137 » A characterization of b-perfect graphs |
176
click to vote
ORDER
2011
15 years 1 months ago
2011
For a finite poset P = (V, ≤), let Bs(P) consist of all triples (x, y, z) ∈ V 3 such that either x < y < z or z < y < x. Similarly, for every finite, simple, and...
176
click to vote
INFOCOM
2008
IEEE
16 years 22 days ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
163
click to vote
SCIA
2009
Springer
16 years 26 days ago
2009
Springer
In the past few years, street-level geoviewers has become a very popular web-application. In this paper, we focus on a first urban concept which has been identified as useful for...
175
click to vote
ISBRA
2007
Springer
16 years 14 days ago
2007
Springer
The biological interpretation of large-scale gene expression data is one of the challenges in current bioinformatics. The state-of-theart approach is to perform clustering and then...
173
click to vote
WEBI
2005
Springer
15 years 11 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...