Hypergraph

Results: 211



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

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

Add to Reading List

Source URL: geometry.stanford.edu

Language: English - Date: 2013-07-22 03:52:47
52Stable and Informative Spectral Signatures for Graph Matching Nan Hu Raif M. Rustamov Leonidas Guibas Stanford University

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

Add to Reading List

Source URL: geometry.stanford.edu

Language: English - Date: 2014-04-22 01:44:54
53Demonstrating Interactive Multi-resolution Large Graph Exploration Zhiyuan Lin College of Computing Georgia Tech Atlanta, GA, USA

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

Add to Reading List

Source URL: www.cc.gatech.edu

Language: English - Date: 2014-03-20 03:09:27
54PHYSICAL REVIEW E 80, 036118 共2009兲 Hypergraph topological quantities for tagged social networks Vinko Zlatić,1,2 Gourab Ghoshal,3 and Guido Caldarelli1,4 1

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

Add to Reading List

Source URL: www.guidocaldarelli.com

Language: English - Date: 2012-07-01 15:30:44
    55An Overview of the GXL Graph Exchange Language Andreas Winter, Bernt Kullbach, and Volker Riediger Universit¨ at Koblenz-Landau

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

    Add to Reading List

    Source URL: www.gupro.de

    Language: English - Date: 2005-04-26 06:11:22
    56Evaluation of an Algorithm for the Transversal Hypergraph Problem Dimitris J. Kavvadias1 and Elias C. Stavropoulos2? 1 University of Patras, Department of Mathematics, GRPatras, Greece

    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

    Add to Reading List

    Source URL: lca.ceid.upatras.gr

    Language: English - Date: 2007-05-09 09:01:43
      57Hypergraph-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

      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

      Add to Reading List

      Source URL: www.cise.ufl.edu

      Language: English - Date: 2012-02-12 11:21:37
        58MINORS OF BOOLEAN FUNCTIONS WITH RESPECT TO CLIQUE FUNCTIONS AND HYPERGRAPH HOMOMORPHISMS ˇ RIL ˇ ERKKO LEHTONEN AND JAROSLAV NESET

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

        Add to Reading List

        Source URL: iti.mff.cuni.cz

        Language: English - Date: 2016-02-04 05:53:37
          59A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium

          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

          Add to Reading List

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

          Language: English - Date: 2015-02-09 05:54:36
          60An 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

          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

          Add to Reading List

          Source URL: iti.mff.cuni.cz

          Language: English - Date: 2016-02-04 05:53:37