2000 character limit reached
Linear time algorithm for computing the rank of divisors on cactus graphs
Published 12 Jan 2016 in math.CO, cs.DM, and cs.DS | (1601.03038v1)
Abstract: Rank of divisor on graph was introduced in 2007 and it quickly attracts many attentions. Recently, in 2015 the problem for computing this quantity was proved to be NP-hard. In this paper, we describe a linear time algorithm for this problem limited on cactus graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.