108 search results - page 1 / 22 » Maximal Intersection Queries in Randomized Graph Models |
CSR
2007
Springer
13 years 11 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
ENDM
2008
13 years 4 months ago
2008
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...