Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

The SDN and NFV paradigms enable novel network services which can be realized and embedded in a flexible and rapid manner. For… Expand

2015

2015

The class of unichord-free graphs was recently investigated in the context of vertex-colouring (Trotignon and Vušković in J Graph… Expand

2014

2014

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

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

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

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

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… Expand

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

2004

2004

The obnoxious center problem in a graph G asks for a location on an edge of the graph such that the minimum weighted distance… Expand

1995

1995

A graphG is called a block—cactus graph if each block ofG is complete or a cycle. In this paper, we shall show that a block… Expand