Graph Matching with Anchor Nodes: A Learning Approach Nan Hu Raif M. Rustamov Leonidas Guibas Stanford University

Source URL: geometry.stanford.edu

• Combinatorial optimization
• Graph theory
• Matching
• Graph
• Hypergraph
• Graph operations
• NP-complete problems
• Bipartite double cover
• Line graph

Stable and Informative Spectral Signatures for Graph Matching Nan Hu Raif M. Rustamov Leonidas Guibas Stanford University

Source URL: geometry.stanford.edu

• Graph operations
• Algebraic graph theory
• Graph theory
• Line graph
• Matching
• Graph
• Bipartite graph
• Laplacian matrix
• Spectral graph theory
• Hypergraph
• Bipartite double cover
• Book:Graph Theory I

Demonstrating Interactive Multi-resolution Large Graph Exploration Zhiyuan Lin College of Computing Georgia Tech Atlanta, GA, USA

Source URL: www.cc.gatech.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Graph drawing
• Connectivity
• Graph
• Cycle
• Directed graph
• Force-directed graph drawing
• Hypergraph

PHYSICAL REVIEW E 80, 036118 共2009兲 Hypergraph topological quantities for tagged social networks Vinko Zlatić,1,2 Gourab Ghoshal,3 and Guido Caldarelli1,4 1

Source URL: www.guidocaldarelli.com

An Overview of the GXL Graph Exchange Language
Andreas Winter, Bernt Kullbach, and Volker Riediger Universit¨ at Koblenz-Landau

Source URL: www.gupro.de

• Computing
• GXL
• Data
• Mathematics
• GraphML
• Graph rewriting
• Hypergraph
• Graph

Evaluation of an Algorithm for the Transversal Hypergraph Problem Dimitris J. Kavvadias1 and Elias C. Stavropoulos2? 1 University of Patras, Department of Mathematics, GRPatras, Greece

Source URL: lca.ceid.upatras.gr

Hypergraph-based Task-Bundle Scheduling Towards Efficiency and Fairness in Heterogeneous Distributed Systems Han Zhao, Xinxin Liu, Xiaolin Li Scalable Software Systems Laboratory Department of Computer Science Oklahoma S

Source URL: www.cise.ufl.edu

MINORS OF BOOLEAN FUNCTIONS WITH RESPECT TO CLIQUE FUNCTIONS AND HYPERGRAPH HOMOMORPHISMS ˇ RIL ˇ ERKKO LEHTONEN AND JAROSLAV NESET

Source URL: iti.mff.cuni.cz

A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium

Source URL: www.zaik.uni-koeln.de

• Graph theory
• Mathematics
• NP-complete problems
• Graph coloring
• Hypergraph
• Dominating set
• Ear decomposition
• Graph
• Line graph
• Modular decomposition

An algorithm for two coloring of hypergraphs G´abor Heged˝ us Abstract Let r > 1 be a fix integer. Let H be an arbitrary r-uniform hypergraph. We give an algorithmic, elementary proof of the fact, that there exists a 2

Source URL: iti.mff.cuni.cz