Filters








82,455 Hits in 8.1 sec

House of Graphs: A database of interesting graphs

Gunnar Brinkmann, Kris Coolsaet, Jan Goedgebeur, Hadrien Mélot
2013 Discrete Applied Mathematics  
In this note we present House of Graphs (http://hog.grinvin.org) which is a new database of graphs.  ...  The key principle is to have a searchable database and offer -- next to complete lists of some graph classes -- also a list of special graphs that already turned out to be interesting and relevant in the  ...  At the moment the Website House of Graphs offers (among others) the following lists: • All graphs registered as interesting in the database.  ... 
doi:10.1016/j.dam.2012.07.018 fatcat:f44zofgqmndfhktt6mm6xcmbcm

Private Renting vs. Mortgage Home Buying: Case of British Housing Market—A Bayesian Network and Directed Acyclic Graphs Approach

Janusz Sobieraj, Dominik Metelski
2022 Buildings  
forms of housing tenure in the U.K. and analyses conditional dependencies of a range of EHS variables using a directed acyclic graph (DAG).  ...  The worsening of housing problems in many countries has become a topic of global interest. Researchers point to a variety of factors that influence individual housing tenure decisions.  ...  Based on the extensive EHS database (with a very large number of variables), the aim of this study is to examine the apparent flows between housing tenure in the context of various variables that find  ... 
doi:10.3390/buildings12020189 fatcat:jdqcu75avrez5abfaar6mv5tdy

Graph-based data mining

D.J. Cook, L.B. Holder
2000 IEEE Intelligent Systems and their Applications  
Subdue has discovered several interesting patterns in the ASRS database.  ...  of a graph.  ... 
doi:10.1109/5254.850825 fatcat:uhmbej7osncgndxkc7rbyvvtmi

Motion graphs

Lucas Kovar, Michael Gleicher, Frédéric Pighin
2002 ACM Transactions on Graphics  
Given a corpus of motion capture data, we automatically construct a directed graph called a motion graph that encapsulates connections among the database.  ...  The motion graph consists both of pieces of original motion and automatically generated transitions. Motion can be generated simply by building walks on the graph.  ...  Our work was made possible through generous motion data donations from Spectrum Studios (particularly Demian Gordon), House of Moves, and The Ohio State University.  ... 
doi:10.1145/566570.566605 fatcat:cr4szcbmzzcqdj5s6ipkh7aquy

Frequent Sub-graph Mining on Edge Weighted Graphs [chapter]

Chuntao Jiang, Frans Coenen, Michele Zito
2010 Lecture Notes in Computer Science  
These are also issues with respect to other forms of frequent pattern mining but are exacerbated in the context of frequent sub-graph mining.  ...  To reduced the search space, and address these twin overheads, a weighted approach to sub-graph mining is proposed.  ...  Christian Setzkorn from the Faculty of Veterinery Science, University of Liverpool for extracting the simplified form of the data and Mrs Puteri Nor Ellyza Nohuddin for assisting us to get the data.  ... 
doi:10.1007/978-3-642-15105-7_7 fatcat:qdaxkgv7ozebhos2tlvny6dno4

The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing [article]

Siddhartha Sahu, Amine Mhedhbi, Semih Salihoglu, Jimmy Lin, M. Tamer Özsu
2017 arXiv   pre-print
We further reviewed user feedback in the mailing lists, bug reports, and feature requests in the source repositories of a large suite of software products for processing graphs.  ...  In particular, real-world graphs represent a very diverse range of entities and are often very large, and scalability and visualization are undeniably the most pressing challenges faced by participants  ...  The most popular multiple format combination was a relational database format and a graph database format.  ... 
arXiv:1709.03188v1 fatcat:cwkregm4nbgcxf2wwzpgdf3pam

Learning Graph Matching [article]

Tiberio S. Caetano, Julian J. McAuley, Li Cheng, Quoc V. Le, Alex J. Smola
2008 arXiv   pre-print
In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs.  ...  We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them.  ...  Experiments House Sequence For our first experiment, we consider the CMU 'house' sequence -a dataset consisting of 111 frames of a toy house [32] .  ... 
arXiv:0806.2890v1 fatcat:ndhuw7afj5ertpgaigjjrxhrhu

Weighted graph characteristics from oriented line graph polynomials

Peng Ren, Richard C Wilson, Edwin R Hancock
2009 2009 IEEE 12th International Conference on Computer Vision  
We develop a novel method for extracting graph characteristics from edge-weighted graphs, based on an extension of the Ihara zeta function from unweighted to edgeweighted graphs.  ...  We also present a spectral analysis of the edge-weighted graph Ihara coefficients and indicate their advantages over graph spectral methods.  ...  The first set of graphs are extracted from three sequences of images of model houses, referred to as the CMU, MOVI and Chalet sequences (samples shown in Figure 4(a) ).  ... 
doi:10.1109/iccv.2009.5459449 dblp:conf/iccv/RenWH09 fatcat:rfq77ktitjdkjmnzmfr4evbrg4

Learning Graph Matching

T.S. Caetano, J.J. McAuley, Li Cheng, Q.V. Le, A.J. Smola
2009 IEEE Transactions on Pattern Analysis and Machine Intelligence  
In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs.  ...  We present a method for learning graph matching: The training examples are pairs of graphs and the "labels" are matches between them.  ...  NICTA is funded by the Australian Government's Backing Australia's Ability initiative and the Australian Research Council's ICT Centre of Excellence program.  ... 
doi:10.1109/tpami.2009.28 pmid:19372609 fatcat:3c6p2au2gzf4bkpvlbhtnoguki

Learning Graph Matching

Tiberio S. Caetano, Li Cheng, Quoc V. Le, Alex J. Smola
2007 2007 IEEE 11th International Conference on Computer Vision  
In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs.  ...  We present a method for learning graph matching: The training examples are pairs of graphs and the "labels" are matches between them.  ...  NICTA is funded by the Australian Government's Backing Australia's Ability initiative and the Australian Research Council's ICT Centre of Excellence program.  ... 
doi:10.1109/iccv.2007.4408838 dblp:conf/iccv/CaetanoCLS07 fatcat:okn5p5ov6nge7alqtlxe4kws5a

Simulation Prototyping of an Experimental Solar House

Anna Osborne, Stuart Baur, Katie Grantham
2010 Energies  
The home was evaluated using the predicted data developed with the use of Energy-10 Version 1.8.  ...  This paper presents a comparative analysis between an energy simulation model and an actual solar home. The case study used was the Team Missouri's 2009 Solar Decathlon entry.  ...  Department of Energy throughout the Solar Decathlon.  ... 
doi:10.3390/en3061251 fatcat:xz7bf3tfuffnvl7dcgfblo7h2y

On almost hypohamiltonian graphs [article]

Jan Goedgebeur, Carol T. Zamfirescu
2019 arXiv   pre-print
We provide a lower bound for the order of the smallest planar a.h. graph and improve the upper bound for the order of the smallest planar a.h. graph containing a cubic vertex.  ...  To this end, we present a specialised algorithm which generates complete sets of a.h. graphs for various orders. Furthermore, we show that the smallest cubic a.h. graphs have order 26.  ...  The graphs from Theorem 2.18 can be downloaded from the database of interesting graphs at the House of Graphs [4] by searching for the keywords "planar cubic almost hypohamiltonian".  ... 
arXiv:1606.06577v4 fatcat:c6wgjapnvnhlvhbtokza57biu4

Anytime graph matching

Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel
2016 Pattern Recognition Letters  
In this paper, we propose and explain the use of anytime algorithms in graph matching (GM). GM methods have been involved in many pattern recognition problems.  ...  In such a context, GM methods are part of a more complex retrieval system that imposes time and memory constraints on such methods.  ...  In both A * and DF, the problem of solving h(p) is of first interest.  ... 
doi:10.1016/j.patrec.2016.10.004 fatcat:fvnej4veizfxbmyb4ghdxzi2zi

The Maven Dependency Graph: a Temporal Graph-based Representation of Maven Central [article]

Amine Benelallam, Nicolas Harrand, César Soto Valero, Benoit Baudry, Olivier Barais
2019 arXiv   pre-print
This open source data set provides two contributions: a snapshot of the whole Maven Central taken on September 6, 2018, stored in a graph database in which we explicitly model all dependencies; an open  ...  As of September 6, 2018, this repository includes 2.8M artifacts (compiled piece of code implemented in a JVM-based language), each of which is characterized with metadata such as exact version, date of  ...  graph database.  ... 
arXiv:1901.05392v1 fatcat:52j65vc4mng2xb2rye4sn5kwli

A survey of repositories in graph theory [article]

Srinibas Swain, C. Paul Bonnington, Graham Farr, Kerri Morgan
2020 arXiv   pre-print
This survey reviews many of these graph repositories and summarises the scope and contents of each repository.  ...  Since the pioneering work of R. M. Foster in the 1930s, many graph repositories have been created to support research in graph theory.  ...  Acknowledgement The authors would like to thank Charles Colbourn, Marston Conder, and Brendan McKay for their comments on earlier versions of this paper.  ... 
arXiv:2006.12741v1 fatcat:uxzb3xfahbesbdhgynn3y7kugu
« Previous Showing results 1 — 15 out of 82,455 results