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.
Filters
Distributed Subgraph Enumeration via Backtracking-based Framework
[article]
2020
arXiv
pre-print
Preserved Fulltext
Other Versions
Each task enumerates subgraphs around a vertex in the data graph, guided by a backtracking-based execution plan. B-BENU does not shuffle any partial matching result. ...
To overcome the drawback, we develop the Batch-BENU framework (B-BENU) for distributed subgraph enumeration. B-BENU executes a group of local search tasks in parallel. ...
Backtracking-based Framework The backtracking-based framework is popular among serial subgraph isomorphism algorithms. ...
arXiv:2006.12819v3
fatcat:orfdrbgyozcjrowlsdambm4c5q
An experimental evaluation of refinement techniques for the subgraph isomorphism backtracking algorithms
2020
Open 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.
Numerous algorithms for solving the problem exist in the literature and most of them are based on the backtracking approach. ...
is a subgraph of the target graph. ...
This work was partially supported by the Slovenian Research Agency and the projects "P2-0095 Parallel and distributed systems" and "N2-0053 Graph Optimisation and Big Data". ...
doi:10.1515/comp-2020-0149
fatcat:falfqmte7jgkncpv2sr6hmdrza
A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets
[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.
Counting subgraphs is however computationally very expensive and there has been a large body of work on efficient algorithms and strategies to make subgraph counting feasible for larger subgraphs and networks ...
Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as network motifs and graphlet-based metrics, which have been widely used to categorize ...
Their base method consists on a backtracking algorithm that is applied to each vertex. ...
arXiv:1910.13011v1
fatcat:ntfvanxbafdlfkyawb64dwxnpa
2021 Index IEEE Transactions on Parallel and Distributed Systems Vol. 32
2022
IEEE Transactions on Parallel and Distributed Systems
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 2021; you can also visit the original URL.
The file type is application/pdf.
Li, H., +, TPDS July 2021 1828-1841
Towards Efficient Distributed Subgraph Enumeration Via Backtrack-
ing-Based Framework. ...
Thakkar, H.K., +, TPDS Dec. 2021 2906-2920 Towards Efficient Distributed Subgraph Enumeration Via Backtracking-Based Framework. ...
doi:10.1109/tpds.2021.3107121
fatcat:e7bh2xssazdrjcpgn64mqh4hb4
FPT Algorithms for Finding Near-Cliques in c-Closed Graphs
[article]
2021
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 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
A number of effective backtracking-based heuristics for these problems have emerged from recent empirical work in social network analysis. ...
In practice, due to noise in data, one wishes to actually discover "near-cliques", which can be characterized as cliques with a sparse subgraph removed. ...
Moreover, we use this result to show that maximal bounded co-degenerate subgraphs can be enumerated efficiently. ...
arXiv:2007.09768v4
fatcat:z6eu4ca7orez5cdiexwavuzgg4
Scalable Pattern Matching in Metadata Graphs via Constraint Checking
[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.
Other Versions
We present an algorithmic pipeline that bases pattern matching on constraint checking. ...
Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration. ...
matching and search space reduction, towards offering efficiency. ...
arXiv:1912.08453v2
fatcat:jrf3hcy6bnbcff6z256yefjowu
YewPar
2020
Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
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 make the following contributions. (1) We present a novel formal model of parallel backtracking search, covering enumeration, decision, and optimisation search. (2) We introduce Lazy Node Generators ...
We aim to improve the reuse of intricate parallel search implementations by providing the first general purpose scalable parallel framework for exact combinatorial search, YewPar. ...
work based on a backtracking budget similar to mts [8]. ...
doi:10.1145/3332466.3374537
dblp:conf/ppopp/ArchibaldMST20
fatcat:telo5wgflrdhnfjp3763ukwo3y
Efficient Subgraph Matching by Postponing Cartesian Products
2016
Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16
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 2019; you can also visit the original URL.
The file type is application/pdf.
We propose a new framework by postponing the Cartesian products based on the structure of a query to minimize the redundant Cartesian products. ...
It has been shown that the matching order of query vertices is a very important aspect to the efficiency of a subgraph matching algorithm. ...
Thus, we propose a new framework towards efficient and scalable subgraph matching, and its pseudocode is shown in Algorithm 1, denoted CFL-Match. ...
doi:10.1145/2882903.2915236
dblp:conf/sigmod/BiCLQZ16
fatcat:b2ksatady5as5by7er5nrc5kl4
A Survey on Distributed Graph Pattern Matching in Massive Graphs
2021
ACM Computing Surveys
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 2022; you can also visit the original URL.
The file type is application/pdf.
Besides its NP-completeness, the strict constraints of subgraph isomorphism are making it impractical for graph pattern matching (GPM) in the context of big data. ...
This article discusses and proposes a classification of distributed GPM approaches with a narrow focus on the relaxed models. ...
The way its algorithm was distributed is not efficient and needs to be revised. ...
doi:10.1145/3439724
fatcat:vib22wz2zffo3c5alriufetwaa
Leveraging efficient indexing schema to support multigraph query answering
2016
Ingénierie des Systèmes d'Information
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 2019; you can also visit the original URL.
The file type is application/pdf.
Secondly, it performs an efficient subgraph search to output the entire set of embeddings for the given query. ...
However, performing subgraph query on multigraphs is still an open issue since, unfortunately, all the existing algorithms for subgraph query matching are not able to adequately leverage the multiple relationships ...
Acknowledgments: This work has been funded by Labex NUMEV (NUMEV, ANR-10-LABX-20) and French National Research Agency, framework of the program "Investissements d'Avenir" (GEOSUD, ANR-10-EQPX-20). ...
doi:10.3166/isi.21.3.53-74
fatcat:wl5nub6hpfbsfan664bfgmhlgu
Learning to Sample Hard Instances for Graph Algorithms
[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.
Other Versions
In particular, our method outperforms rule-based algorithms in the 3-coloring problem. ...
Through experiments, we demonstrate that our proposed method can generate instances that are a few to several orders of magnitude harder than the random-based approach in many settings. ...
It models the hard graph distribution using a neural network and trains the model via reinforcement learning. ...
arXiv:1902.09700v2
fatcat:uvacyzjdtndubo53ozqwipsz7u
Scalable subgraph mapping for acyclic computation accelerators
2006
Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems - CASES '06
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 2015; you can also visit the original URL.
The file type is application/pdf.
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. ...
Subgraph Isomorphism Algorithm: The algorithm used to determine isomorphism, Algorithm 1, is based on the backtracking search strategy described in [19] , which was itself adapted from [28] . 1 Input ...
Another technique is to always branch toward adding a subgraph first (lines 4 and 19) . ...
doi:10.1145/1176760.1176779
dblp:conf/cases/ClarkHMY06
fatcat:75ei6y23zretlhq4rvdefawg4i
GPD: A Graph Pattern Diffusion Kernel for Accurate Graph Classification with Applications in Cheminformatics
2010
IEEE/ACM Transactions on Computational Biology & Bioinformatics
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 2018; you can also visit the original URL.
The file type is application/pdf.
The experimental results demonstrate that our method is significantly better than competing methods such as those kernel functions based on paths, cycles, and subgraphs. ...
We then map subgraphs to graphs in the graph database and use a process we call "pattern diffusion" to label nodes in the graphs. ...
Although we have developed a very efficient computational framework, computing a GPD kernel may be hard for large graphs. ...
doi:10.1109/tcbb.2009.80
pmid:20431140
pmcid:PMC3058227
fatcat:z5dysutf45delodcbpzeiijqhe
Graph Polish: A Novel Graph Generation Paradigm for Molecular Optimization
2021
IEEE Transactions on Neural Networks and Learning Systems
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 2021; you can also visit the original URL.
The file type is application/pdf.
We then propose an effective and efficient learning framework, Teacher and Student polish, to capture the dependencies in the optimization steps. ...
A policy-based RL method was designed to optimize RNNs to generate molecules toward the desired properties [52] . ...
All possible candidate attachments at tree node i in the junction tree are enumerated to finally construct a candidate subgraph set G i = {G i,1 , . . .}. ...
doi:10.1109/tnnls.2021.3106392
pmid:34520363
fatcat:sbr2bsmhdzezfhhxae2zjldiwa
Towards Incremental Cycle Analysis in ESMoL Distributed Control System Models
[chapter]
2011
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 2015; you can also visit the original URL.
The file type is application/pdf.
We give a general form of a cycle enumeration algorithm that makes use of graph hierarchy to improve analysis efficiency. ...
Our framework also stores simple connectivity information in the model to accelerate future cycle analyses when additional components are added or modifications are made. ...
In our work we only consider the structural problem of loop detection in model-based distributed embedded system designs. ...
doi:10.1007/978-3-642-22045-6_9
fatcat:wite6dlpyrfo7mwrtmyt7vtsoq
« Previous
Showing results 1 — 15 out of 389 results