Radial Sets: Interactive Visual Analysis of Large Overlapping Sets Bilal Alsallakh, Wolfgang Aigner, Silvia Miksch, and Helwig Hauser Fig. 1. The main interface of Radial Sets: (a) the sizes of the overlapping sets, (b)

Source URL: publik.tuwien.ac.at

• Statistics
• Diagrams
• Euler diagram
• Hypergraph
• Histogram
• Boolean algebra
• Communication design

Trust Amongst Rogues? A Hypergraph Approach for Comparing Clandestine Trust Networks in MMOGs Muhammad Aurangzeb Ahmad*, Brian Keegan†, Dmitri Williams^, Jaideep Srivastava*, Noshir Contractor† †

Source URL: www.brianckeegan.com

Image Retrieval via Probabilistic Hypergraph Ranking Yuchi Huang Qingshan Liu Shaoting Zhang Dimitris N. Metaxas Rutgers University 617 Bowser Road, Piscataway, NJ 08854

Source URL: www.research.rutgers.edu

Trust Amongst Rogues? A Hypergraph Approach for Comparing Clandestine Trust Networks in MMOGs Muhammad Aurangzeb Ahmad*, Brian Keegan†, Dmitri Williams^, Jaideep Srivastava*, Noshir Contractor† †

Source URL: 129.105.161.80

Contemporary Mathematics Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction

Source URL: gauss.cs.ucsb.edu

• Graph theory
• Mathematics
• NP-complete problems
• Graph partition
• Hypergraph
• Graph traversal
• Breadth-first search
• Vertex
• Graph
• Shortest path problem
• Ear decomposition
• HopcroftKarp algorithm

PDF Document

Source URL: ceur-ws.org

• Graph theory
• Graph database
• Graph
• Triplestore
• Hypergraph
• Dense graph
• Neighbourhood
• Sparksee
• RDFLib
• Line graph

PDF Document

Source URL: cs.uwaterloo.ca

• Hypergraph
• Algorithm
• Data cleansing

Exploiting a Hypergraph Model for Finding Golomb Rulers Manuel Sorge? , Hannes Moser?? , Rolf Niedermeier, and Mathias Weller? ? ? Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Berlin, Germany {

Source URL: fpt.akt.tu-berlin.de

BROOKS TYPE RESULTS FOR CONFLICT-FREE COLORINGS AND {a, b}-FACTORS IN GRAPHS. MARIA AXENOVICH AND JONATHAN ROLLIN Abstract. A vertex-coloring of a hypergraph is conflict-free, if each edge contains a vertex whose color i

Source URL: www.math.kit.edu

Santa Claus Meets Hypergraph Matchings Arash Asadpour∗, Uriel Feige†, and Amin Saberi‡ June 17, 2008 Abstract We consider the problem of max-min fair allocation of indivisible

Source URL: www.wisdom.weizmann.ac.il