Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Cactus graph

Known as: Cactus (disambiguation) 
In graph theory, a cactus (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common… Expand
Wikipedia

Papers overview

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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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 defined as the summation of quantitiesq d(u)+d(v… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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
  • figure 1
  • figure 3
  • figure 3
  • figure 4
  • figure 5
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
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
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
  • figure 1
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
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?