Cactus graph

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1998-2016
0519982016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Broadcasting is the process of dissemination of a message from one vertex (called originator) to all other vertices in the graph… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we consider several… (More)
  • figure 1
Is this relevant?
2014
2014
A homomorphism from a graph <i>G</i> to a graph <i>H</i> is a function from <i>V</i>(<i>G</i>) to <i>V</i>(<i>H</i>) that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
An -labelling of a graph is an assignment of nonnegative integers to the vertices of such that the difference between the labels… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
We introduce a data structure, analysis, and visualization scheme called a cactus graph for comparing sets of related genomes. In… (More)
Is this relevant?
2010
2010
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
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… (More)
  • 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 least twice. The… (More)
  • figure 1
Is this relevant?
2005
2005
Let p be a positive integer and G = (V;E) a graph. A subset S of V is a p-dominating set if every vertex of V S is dominated at… (More)
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… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?