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)

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

2017

2017

- Maja Cevnik, Janez Zerovnik
- J. Comb. Optim.
- 2017

Broadcasting is the process of dissemination of a message from one vertex (called originator) to all other vertices in the graphâ€¦Â (More)

Is this relevant?

2014

2014

- Kalyani Das
- ArXiv
- 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)

Is this relevant?

2014

2014

- Andreas GÃ¶bel, Leslie Ann Goldberg, David Richerby
- TOCT
- 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)

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)

Is this relevant?

2010

2010

- Benedict Paten, Mark Diekhans, +4 authors David Haussler
- RECOMB
- 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

- Kalyani Das
- 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)

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)

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)

Is this relevant?

2005

2005

- Mostafa Blidia, Mustapha Chellali, Lutz Volkmann
- Discussiones Mathematicae Graph Theory
- 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

- Boaz Ben-Moshe, Binay K. Bhattacharya, Qiaosheng Shi
- ISAAC
- 2005

In this paper, we provide efficient algorithms for solving the weighted center problems in a cactus graph. In particular, an O(nâ€¦Â (More)

Is this relevant?