Zobrazeno 1 - 10
of 311
pro vyhledávání: '"Maximum common subgraph isomorphism problem"'
Autor:
Nan Huang, Dominik Roje
Publikováno v:
SN Computer Science. 2
We present QUBO objective functions for the maximum common subgraph isomorphism problem, proved their correctness and illustrate them with a few toy problems. Very small-scale problems can be solved by the D-Wave 2X machine with high enough success p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aba9a18cf09e253d85bc8261926d8f2b
https://doi.org/10.1007/s42979-020-00431-5
https://doi.org/10.1007/s42979-020-00431-5
Autor:
Nan Huang
Publikováno v:
2020 IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE).
In this paper, we extend the algorithm of [6] to solve the k-densest maximum common subgraph problem. By solving the k-densest maximum common subgraph isomorphism problem, we find high complexity common substructures between input graphs. We prove th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::327cfe4369ac82a836c8c7b7d4a73b98
https://doi.org/10.1109/csde50874.2020.9411586
https://doi.org/10.1109/csde50874.2020.9411586
Publikováno v:
Mathematics and Computers in Simulation. 151:147-155
Given an undirected graph with weights on the vertices, the maximum weight clique problem requires finding the clique of the graph which has the maximum weight. The problem is a general form of the maximum clique problem. In this paper, we encode wei
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23ec23a39e1a74b6afc6f363844b549c
https://doi.org/10.1016/j.matcom.2017.02.003
https://doi.org/10.1016/j.matcom.2017.02.003
Autor:
Thorsten Koch, Daniel Rehfeldt
Publikováno v:
Journal of Computational Mathematics. 36:459-468
Transformations of Steiner tree problem variants have been frequently discussed in the literature. Besides allowing to easily transfer complexity results, they constitute a cen- tral pillar of exact state-of-the-art solvers for well-known variants su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1f4238543fe07a66148e5b2ddbf7fd5
https://doi.org/10.4208/jcm.1709-m2017-0002
https://doi.org/10.4208/jcm.1709-m2017-0002
Publikováno v:
Neurocomputing. 277:89-100
A multi-graph is represented by a bag of graphs. Semi-supervised multi-graph classification is a partly supervised learning problem, which has a wide range of applications, such as bio-pharmaceutical activity tests, scientific publication categorizat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89fa7fa0d0a01cba89a5ad641a2974c7
https://doi.org/10.1016/j.neucom.2017.01.114
https://doi.org/10.1016/j.neucom.2017.01.114
Publikováno v:
Networks. 71:136-152
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be1eac22981905560f9e7b501864b635
https://doi.org/10.1002/net.21791
https://doi.org/10.1002/net.21791
Autor:
Dheepikaa Natarajan, Sayan Ranu
Publikováno v:
Knowledge and Information Systems. 54:123-149
Mining subgraph patterns is an active area of research due to its wide-ranging applications. Examples include frequent subgraph mining, discriminative subgraph mining, statistically significant subgraphs. Existing research has primarily focused on mi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1aa3f0da5a38dc7cc4c6da32bebc502
https://doi.org/10.1007/s10115-017-1129-y
https://doi.org/10.1007/s10115-017-1129-y
Publikováno v:
Theoretical Computer Science. 701:54-69
We present and compare various methods to construct efficient QUBO formulations for the Graph Isomorphism Problem—one of a very few problems in NP that is neither known to be solvable in polynomial time nor NP-complete—and two related Subgraph Is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc0e8a024fee79839b5151f5f0caa32d
https://doi.org/10.1016/j.tcs.2017.04.016
https://doi.org/10.1016/j.tcs.2017.04.016
Publikováno v:
Proceedings of the VLDB Endowment. 10:1538-1549
Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a given graph, has been extensively studied. Besides its theoretical val
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bacbee42fa75e4411e5934b6b8dab8ae
https://doi.org/10.14778/3137628.3137660
https://doi.org/10.14778/3137628.3137660
Publikováno v:
Networks. 69:189-204
We propose a two-stage stochastic programming framework for designing or identifying “resilient,” or “reparable” structures in graphs whose topology may undergo a stochastic transformation. The reparability of a subgraph satisfying a given pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::caf610f03ff7874209762c9dd61f70a8
https://doi.org/10.1002/net.21727
https://doi.org/10.1002/net.21727