
Component Edge Connectivity of Hypercubelike Networks
As a generalization of the traditional connectivity, the gcomponent edg...
read it

Graph Theory in the Classification of Information Systems
Risk classification plays an important role in many regulations and stan...
read it

The Landscape of Minimum Label Cut (Hedge Connectivity) Problem
Minimum Label Cut (or Hedge Connectivity) problem is defined as follows:...
read it

A Simple Approximation for a Hard Routing Problem
We consider a routing problem which plays an important role in several a...
read it

Neurogeometry of perception: isotropic and anisotropic aspects
In this paper we first recall the definition of geometical model of the ...
read it

Vertex Sparsification for Edge Connectivity
Graph compression or sparsification is a basic informationtheoretic and...
read it

Correspondent Banking Networks: Theory and Experiment
We employ the mathematical programming approach in conjunction with the ...
read it
Hedge Connectivity without Hedge Overlaps
Connectivity is a central notion of graph theory and plays an important role in graph algorithm design and applications. With emerging new applications in networks, a new type of graph connectivity problem has been getting more attention–hedge connectivity. In this paper, we consider the model of hedge graphs without hedge overlaps, where edges are partitioned into subsets called hedges that fail together. The hedge connectivity of a graph is the minimum number of hedges whose removal disconnects the graph. This model is more general than the hypergraph, which brings new computational challenges. It has been a long open problem whether this problem is solvable in polynomial time. In this paper, we study the combinatorial properties of hedge graph connectivity without hedge overlaps, based on its extremal conditions as well as hedge contraction operations, which provide new insights into its algorithmic progress.
READ FULL TEXT
Comments
There are no comments yet.