715 search results - page 60 / 143 » On graphs with subgraphs having large independence numbers |
TVCG
2008
13 years 8 months ago
2008
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
STOC
2010
ACM
14 years 21 days ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
JUCS
2008
13 years 8 months ago
2008
: Feature selection methods are often applied in the context of document classification. They are particularly important for processing large data sets that may contain millions of...
ICPP
2008
IEEE
14 years 3 months ago
2008
IEEE
—We consider resource allocation for distributed streaming applications running in a grid environment, where continuously streaming data needs to be aggregated and processed to p...