In this paper, we study the minimum cycle base of the planar graphs obtained from two 2-connected planar graphs by identifying an edge (or a cycle) of one graph with the corresponding edge (or cycle) of another, related with map geometries, i.e., Smarandache 2-dimensional manifolds
We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weight...
AbstractLet G = (V, E) be a graph with arbitrary (perturbed) edge weights and let C(e) denote the sh...
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that ea...
Abstract: In this paper, we study the minimum cycle base of the planar graphs obtained from two 2-co...
Abstract In this paper we investigate the structure of the shortest co-cycle base(or SCB in short) o...
In this paper we investigate the structure of the shortest co-cycle base(or SCB in short) of connect...
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a suf...
We propose a novel idea for cycles that is based on the network topology in planar graphs. Using the...
AbstractIn this paper we study the cycle base structures of embedded graphs on surfaces. We first gi...
The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cyc...
AbstractIn this paper we investigate cycle base structures of a 2-(edge)-connected graph on surfaces...
Planar fundamental cycle basis belong to a 2-connected simple graph is used for enumerating Hamilto...
Let G be a 2-connected graph with minimum degree d I. Hartman proved that the cycles of length at le...
In this paper, authors investigate the structures of cycle bases with extremal properties which are...
AbstractIn this paper we investigate cycle base structures of a 2-(edge)-connected graph on surfaces...
We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weight...
AbstractLet G = (V, E) be a graph with arbitrary (perturbed) edge weights and let C(e) denote the sh...
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that ea...
Abstract: In this paper, we study the minimum cycle base of the planar graphs obtained from two 2-co...
Abstract In this paper we investigate the structure of the shortest co-cycle base(or SCB in short) o...
In this paper we investigate the structure of the shortest co-cycle base(or SCB in short) of connect...
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a suf...
We propose a novel idea for cycles that is based on the network topology in planar graphs. Using the...
AbstractIn this paper we study the cycle base structures of embedded graphs on surfaces. We first gi...
The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cyc...
AbstractIn this paper we investigate cycle base structures of a 2-(edge)-connected graph on surfaces...
Planar fundamental cycle basis belong to a 2-connected simple graph is used for enumerating Hamilto...
Let G be a 2-connected graph with minimum degree d I. Hartman proved that the cycles of length at le...
In this paper, authors investigate the structures of cycle bases with extremal properties which are...
AbstractIn this paper we investigate cycle base structures of a 2-(edge)-connected graph on surfaces...
We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weight...
AbstractLet G = (V, E) be a graph with arbitrary (perturbed) edge weights and let C(e) denote the sh...
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that ea...
DOI
Add to ORKG