684 search results - page 70 / 137 » A characterization of b-perfect graphs |
179
click to vote
CP
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
PODS
2006
ACM
16 years 6 hour ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
GD
2004
Springer
15 years 5 months ago
2004
Springer
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique c...
101
click to vote
EJC
2008
14 years 12 months ago
2008
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to i...