Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

In this paper we establish polynomial-time algorithms for special classes of parity games. In particular we study various… Expand

Is this relevant?

2016

2016

Given a graph G, let M(G) and ∏ (G) be Zagreb index and Multiplicative Zagreb index. A connected graph is a cactus graph if and… Expand

Is this relevant?

2015

2015

Abstract. The atom-bond connectivity index of a graph G(ABC indexfor short) is deﬁned as the summation of quantitiesq d(u)+d(v… Expand

Is this relevant?

2014

2014

We study the problem of exploration by a mobile entity (agent) of a class of dynamic networks, namely constantly connected… Expand

Is this relevant?

2012

2012

In this paper we present a time optimal self-stabilizing algorithm for the maximal 2-packing in a cactus graph. The cactus is a… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

We introduce a data structure, analysis and visualization scheme called a cactus graph for comparing sets of related genomes… Expand

Is this relevant?

2010

2010

Abstract. A (2,1)-total labelling of a graph is an assignment of integers to each vertex and edge such that: (i) any two adjacent… Expand

Is this relevant?

2008

2008

A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to… Expand

Is this relevant?

2006

2006

A \(2\)-dominating set of a graph \(G\) is a set \(D\) of vertices of \(G\) such that every vertex not in \(S\) is dominated at… Expand

Is this relevant?

2005

2005

In this paper, we provide efficient algorithms for solving the weighted center problems in a cactus graph. In particular, an O(n… Expand

Is this relevant?