A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
House of Graphs: A database of interesting graphs
2013
Discrete Applied Mathematics
Preserved Fulltext
Other Versions
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
Graph-based data mining
2000
IEEE Intelligent Systems and their Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Subdue has discovered several interesting patterns in the ASRS database. ...
The figure also tabulates an evaluation based on compression obtained with the substructure, time required to process the database, a human rating of the discovered concept's interestingness, and the number ...
doi:10.1109/5254.850825
fatcat:uhmbej7osncgndxkc7rbyvvtmi
Motion graphs
2002
ACM Transactions on Graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
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]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
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]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
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. ...
We conducted an online survey aimed at understanding: (i) the types of graphs users have; (ii) the graph computations users run; (iii) the types of graph software users use; and (iv) the major challenges ...
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]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. ...
In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. ...
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
2009
2009 IEEE 12th International Conference on Computer Vision
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also present a spectral analysis of the edge-weighted graph Ihara coefficients and indicate their advantages over graph spectral methods. ...
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. ...
Acknowledgments We acknowledge the financial support from the FET programme within the EU FP7, under the SIMBAD project (contract 213250). ...
doi:10.1109/iccv.2009.5459449
dblp:conf/iccv/RenWH09
fatcat:rfq77ktitjdkjmnzmfr4evbrg4
Learning Graph Matching
2009
IEEE Transactions on Pattern Analysis and Machine Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a method for learning graph matching: The training examples are pairs of graphs and the "labels" are matches between them. ...
In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. ...
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
2007
2007 IEEE 11th International Conference on Computer Vision
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We present a method for learning graph matching: The training examples are pairs of graphs and the "labels" are matches between them. ...
In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. ...
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
On almost hypohamiltonian graphs
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1606.06577v3 fatcat:7covedt6p5gi7dfushmugjx5wqOther Versions
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. ...
Acknowledgements This work was carried out using the Stevin Supercomputer Infrastructure at Ghent University. ...
arXiv:1606.06577v4
fatcat:c6wgjapnvnhlvhbtokza57biu4
Anytime graph matching
2016
Pattern Recognition Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We analyze the properties of the resulting anytime algorithm and consider its performance in terms of the deviation of the provided solution from the optimal or the best one found by a state-of-the-art ...
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. ...
The purpose of such a database was to see how GM methods behave when having low, or high, density graphs. ...
doi:10.1016/j.patrec.2016.10.004
fatcat:fvnej4veizfxbmyb4ghdxzi2zi
The Maven Dependency Graph: a Temporal Graph-based Representation of Maven Central
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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 ...
In this paper, we present the Maven Dependency Graph. ...
As for the graph database backend, we rely on Neo4j [3] , one of the most popular NoSQL databases. It comes along with a powerful SQLlike graph query language, Cypher [2] . ...
arXiv:1901.05392v1
fatcat:52j65vc4mng2xb2rye4sn5kwli
A survey of repositories in graph theory
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Since the pioneering work of R. M. Foster in the 1930s, many graph repositories have been created to support research in graph theory. ...
This survey reviews many of these graph repositories and summarises the scope and contents of each repository. ...
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
On almost hypohamiltonian graphs
2019
Discrete Mathematics & Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
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. ...
Acknowledgements This work was carried out using the Stevin Supercomputer Infrastructure at Ghent University. ...
doi:10.23638/dmtcs-21-4-5
fatcat:6hgvkhfb6na33i3yfntu4rgfli
Extracting Fuzzy Summaries from NoSQL Graph Databases
[chapter]
2015
Advances in Intelligent Systems and Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Graph databases are becoming popular tools and have recently gained significant recognition with the emergence of the so-called NoSQL graph databases. ...
In this paper, we detail the specificities of NoSQL graph databases and we discuss how to summarize them by introducing several types of linguistic summaries, namely structure summaries, data structure ...
The type of housing can be an apartment or a house: we define this value as the node type. ...
doi:10.1007/978-3-319-26154-6_15
fatcat:cv3ol5jllna4zm3ed2fylqmvbq
« Previous
Showing results 1 — 15 out of 82,068 results