760 search results - page 29 / 152 » Algorithms for finding clique-transversals of graphs |
DCC
2001
IEEE
15 years 9 months ago
2001
IEEE
We consider the problem of compressing graphs of the link structure of the World Wide Web. We provide efficient algorithms for such compression that are motivated by recently prop...
67
Voted
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
61
Voted
DM
2008
14 years 9 months ago
2008
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...
80
Voted
WWW
2011
ACM
14 years 4 months ago
2011
ACM
Social hierarchy and stratification among humans is a well studied concept in sociology. The popularity of online social networks presents an opportunity to study social hierarch...
AIPS
2010
14 years 12 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...