Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Cactus graphs, which are connected graphs with no edge contained in two or more different simple cycles, are known to provide… 
2016
2016
The SDN and NFV paradigms enable novel network services which can be realized and embedded in a flexible and rapid manner. For… 
2014
2014
We study the problem of exploration by a mobile entity (agent) of a class of dynamic networks, namely constantly connected… 
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… 
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… 
2009
2009
Edge colouring of an undirected graph G = (V;E) is assigning a colour to each edge e2 E so that any two edges having end-vertex… 
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… 
Review
1994
Review
1994
A graph G is well covered, if any two maximal independent sets of G have the same number of vertices. A graph is called a block…