684 search results - page 37 / 137 » A characterization of b-perfect graphs |
SIGCOMM
2009
ACM
15 years 8 months ago
2009
ACM
Most of the existing literature on empirical studies of Online Social Networks (OSNs) have focused on characterizing and modeling the structure of their inferred friendship graphs...
104
Voted
ASWEC
2008
IEEE
15 years 8 months ago
2008
IEEE
A software component graph, where a node represents a component and an edge represents a use-relation between components, is widely used for analysis methods of software engineeri...
107
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
114
click to vote
TCSV
2008
15 years 1 months ago
2008
This paper presents a graphical model for learning and recognizing human actions. Specifically, we propose to encode actions in a weighted directed graph, referred to as action gra...
COMBINATORICS
2006
15 years 1 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...