Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:1 (2022) #3]

05/25/2023
by   Mitre C. Dourado, et al.
0

In this corrigendum, we give a counterexample to Theorem 5.2 in “On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:1 (2022) #3]. We also present a polynomial-time algorithm for computing the monophonic rank of a starlike graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2021

Ranking Bracelets in Polynomial Time

The main result of the paper is the first polynomial-time algorithm for ...
research
01/27/2019

Subspace arrangements, graph rigidity and derandomization through submodular optimization

This paper presents a deterministic, strongly polynomial time algorithm ...
research
06/01/2022

Control hubs of complex networks and a polynomial-time identification algorithm

Unveiling the underlying control principles of complex networks is one o...
research
05/27/2022

Ranking Binary Unlabelled Necklaces in Polynomial Time

Unlabelled Necklaces are an equivalence class of cyclic words under both...
research
02/21/2018

Spanning Tree Congestion and Computation of Generalized Győri-Lovász Partition

We study a natural problem in graph sparsification, the Spanning Tree Co...
research
06/20/2022

On approximating the rank of graph divisors

Baker and Norine initiated the study of graph divisors as a graph-theore...
research
09/25/2019

α^α-Rank: Practically Scaling α-Rank through Stochastic Optimisation

Recently, α-Rank, a graph-based algorithm, has been proposed as a soluti...

Please sign up or login with your details

Forgot password? Click here to reset