[HTML][HTML] The edge-disjoint paths problem is NP-complete for series–parallel graphs
Many combinatorial problems are NP-complete for general graphs. However, when
restricted to series–parallel graphs or partial k-trees, many of these problems can be solved …
restricted to series–parallel graphs or partial k-trees, many of these problems can be solved …
Transforming graph states using single-qubit operations
Stabilizer states form an important class of states in quantum information, and are of central
importance in quantum error correction. Here, we provide an algorithm for deciding whether …
importance in quantum error correction. Here, we provide an algorithm for deciding whether …
Distinguishing labellings of group action on vector spaces and graphs
Suppose Γ is a group acting on a set X. A k-labeling of X is a map** c: X→{1, 2,…, k}. A
labeling c of X is distinguishing (with respect to the action of Γ) if for any g∈ Γ, g≠ idX, there …
labeling c of X is distinguishing (with respect to the action of Γ) if for any g∈ Γ, g≠ idX, there …
Efficient Learning of Optimal Markov Network Topology with k-Tree Modeling
The seminal work of Chow and Liu (1968) shows that approximation of a finite probabilistic
system by Markov trees can achieve the minimum information loss with the topology of a …
system by Markov trees can achieve the minimum information loss with the topology of a …
A novel graph-based approach for determining molecular similarity
M Hernandez, A Zaribafiyan, M Aramon… - arxiv preprint arxiv …, 2016 - arxiv.org
In this paper, we tackle the problem of measuring similarity among graphs that represent
real objects with noisy data. To account for noise, we relax the definition of similarity using …
real objects with noisy data. To account for noise, we relax the definition of similarity using …
[HTML][HTML] Subgraph isomorphism in graph classes
We investigate the computational complexity of the following restricted variant of Subgraph
Isomorphism: given a pair of connected graphs G=(VG, EG) and H=(VH, EH), determine if H …
Isomorphism: given a pair of connected graphs G=(VG, EG) and H=(VH, EH), determine if H …
Efficient frequent connected subgraph mining in graphs of bounded tree-width
T Horváth, J Ramon - Theoretical Computer Science, 2010 - Elsevier
The frequent connected subgraph mining problem, ie, the problem of listing all connected
graphs that are subgraph isomorphic to at least a certain number of transaction graphs of a …
graphs that are subgraph isomorphic to at least a certain number of transaction graphs of a …
Fixed-parameter tractability of treewidth and pathwidth
HL Bodlaender - The Multivariate Algorithmic Revolution and Beyond …, 2012 - Springer
In this survey, a number of results on the fixed-parameter tractability of treewidth and
pathwidth are discussed. Some emphasis is placed on older results, and proofs that show …
pathwidth are discussed. Some emphasis is placed on older results, and proofs that show …
Improvements to Ullmann's algorithm for the subgraph isomorphism problem
The subgraph isomorphism problem is one of the most important problems for pattern
recognition in graphs. Its applications are found in many different disciplines, including …
recognition in graphs. Its applications are found in many different disciplines, including …
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
The subgraph isomorphism problem, that of finding a copy of one graph in another, has
proved to be intractable except when certain restrictions are placed on the inputs. In this …
proved to be intractable except when certain restrictions are placed on the inputs. In this …