A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k &lt; 2

Cicerone, Serafino

doi:10.3390/a14040105

Cited by 2 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, in [6], the class of k-distance-hereditary graphs was studied. The considered graphs have nice properties for which the distance in each connected induced subgraph is at most k times the distance in the whole graph.…”

Section: Special Issuementioning

confidence: 99%

Special Issue on “Graph Algorithms and Applications”

Cicerone

Stefano

2021

Algorithms

Self Cite

View full text Add to dashboard Cite

The mixture of data in real life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image data, etc. Graphs provide a natural way to represent and analyze these types of data and their relationships. For instance, more recently, graphs have found new applications in solving problems for emerging research fields such as social network analysis, design of robust computer network topologies, frequency allocation in wireless networks, and bioinformatics. Unfortunately, the related algorithms usually suffer from high computational complexity, since some of these problems are NP-hard. Therefore, in recent years, many graph models and optimization algorithms have been proposed to achieve a better balance between efficacy and efficiency. The aim of this Special Issue is to provide an opportunity for researchers and engineers from both academia and the industry to publish their latest and original results on graph models, algorithms, and applications to problems in the real world, with a focus on optimization and computational complexity.

show abstract

Section: Special Issuementioning

confidence: 99%

Special Issue on “Graph Algorithms and Applications”

Cicerone

Stefano

2021

Algorithms

Self Cite

View full text Add to dashboard Cite

show abstract

“…Additional results about the class hierarchy DH( k ), for any rational k ≥ 1, can be found in Cicerone (2011a) , Cicerone (2021) , Cicerone & Di Stefano (2000) , Cicerone & Di Stefano (2004) . This hierarchy is fully general , that is, for each arbitrary graph G there exists a number k ′ such that G ∈ DH( k ′).…”

Section: Introductionmentioning

confidence: 99%

Getting new algorithmic results by extending distance-hereditary graphs via split composition

Cicerone

Stefano

2021

PeerJ Computer Science

Self Cite

View full text Add to dashboard Cite

In this paper, we consider the graph class denoted as Gen(∗;P3,C3,C5). It contains all graphs that can be generated by the split composition operation using path P3, cycle C3, and any cycle C5 as components. This graph class extends the well-known class of distance-hereditary graphs, which corresponds, according to the adopted generative notation, to Gen(∗;P3,C3). We also use the concept of stretch number for providing a relationship between Gen(∗;P3,C3) and the hierarchy formed by the graph classes DH(k), with k ≥1, where DH(1) also coincides with the class of distance-hereditary graphs. For the addressed graph class, we prove there exist efficient algorithms for several basic combinatorial problems, like recognition, stretch number, stability number, clique number, domination number, chromatic number, and graph isomorphism. We also prove that graphs in the new class have bounded clique-width.

show abstract

A Quasi-Hole Detection Algorithm for Recognizing k-Distance-Hereditary Graphs, with k < 2

Cited by 2 publications

References 17 publications

Special Issue on “Graph Algorithms and Applications”

Special Issue on “Graph Algorithms and Applications”

Getting new algorithmic results by extending distance-hereditary graphs via split composition

Contact Info

Product

Resources

About