Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees

Autor: Nagoya Takayuki

Publikováno v: Foundations of Computing and Decision Sciences, Vol 41, Iss 3, Pp 163-181 (2016)

In this paper, we deal with two variants of graph matching, the graph isomorphism with restriction and the prefix set of graph isomorphism. The former problem is known to be NP-complete, whereas the latter problem is known to be GI-complete. We propo

Externí odkaz: https://doaj.org/article/a3720285892e4bf7856495ac9eb0eca4

The Bounds of Vertex Padmakar–Ivan Index on k-Trees

Autor: Shaohui Wang, Zehui Shao, Jia-Bao Liu, Bing Wei

Publikováno v: Mathematics, Vol 7, Iss 4, p 324 (2019)

The Padmakar–Ivan ( P I ) index is a distance-based topological index and a molecular structure descriptor, which is the sum of the number of vertices over all edges u v of a graph such that these vertices are not equidistant from u and v. In this

Externí odkaz: https://doaj.org/article/3435fa0a3a5e4e4fb7667999be6a5925

A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs

Autor: Angelo Monti, Tiziana Calamoneri, Matteo Dell'Orefice

Publikováno v: Theoretical Computer Science. 764:2-14

A locally connected spanning tree (LCST) T of a graph G is a spanning tree of G such that, for each node, its neighborhood in T induces a connected subgraph in G. The problem of determining whether a graph contains an LCST or not has been proved to b

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb3bce2aefcb4390644eb25c3ddbc9fb
https://doi.org/10.1016/j.tcs.2018.02.025

Decomposing degenerate graphs into locally irregular subgraphs

Autor: Julien Bensmail, François Dross, Nicolas Nisse

Publikováno v: Graphs and Combinatorics
Graphs and Combinatorics, Springer Verlag, 2020, 36 (6), pp.1869-1889. ⟨10.1007/s00373-020-02193-6⟩
Graphs and Combinatorics, 2020, 36 (6), pp.1869-1889. ⟨10.1007/s00373-020-02193-6⟩

International audience; A (undirected) graph is locally irregular if no two of its adjacent vertices have the same degree. A decomposition of a graph G into k locally irregular subgraphs is a partition E_1,...,E_k of E(G) into k parts each of which i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b7f19b7234424d3f0c040d2d6ed8e546
https://hal.archives-ouvertes.fr/hal-02090804v3/file/irregular-degenerate.pdf

Polynomial Time Algorithms for Variants of Graph Matching on Partial k-Trees

Autor: Takayuki Nagoya

Publikováno v: Foundations of Computing and Decision Sciences, Vol 41, Iss 3, Pp 163-181 (2016)

In this paper, we deal with two variants of graph matching, the graph isomorphism with restriction and the prefix set of graph isomorphism. The former problem is known to be NP-complete, whereas the latter problem is known to be GI-complete. We propo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af087d827e3e8730eb07a190ad0c0ddf
https://doi.org/10.1515/fcds-2016-0010