301 search results - page 12 / 61 » On Finding Dense Subgraphs |
JDA
2006
14 years 9 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
GC
2002
Springer
14 years 9 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
WALCOM
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract. Finding a maximum acyclic subgraph is on the list of problems that seem to be hard to tackle from a parameterized perspective. We develop two quite efficient algorithms (...
112
click to vote
COMSWARE
2008
IEEE
14 years 11 months ago
2008
IEEE
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
NETWORKS
2006
14 years 9 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...