In this and a subsequent paper (by R. Shull, A. Shuchat, J.B. Orlin and M. Lepp), we introduce a polynomial-time algorithm for transforming an m x n matrix A by projective equivalence into the generalized incidence matrix of a bicircular generalized network N when such a matrix exists. In this paper, we construct the underlying graph G of N byan algorithm of worst-case complexity m 2 n 2. In the sequel, we assign arc weights to G to obtain N and the projective equivalence
We present a polynomial time algorithm to construct a bidirected graph for any totally unimodular ma...
We study four classical graph problems – Hamiltonian path, Traveling salesman, Minimum spanning tree...
In this work, we have made some modifications on the definition of the incidence matrices of a direc...
AbstractIn this and a subsequent paper (by R. Shull, A. Shuchat, J.B. Orlin and M. Lepp), we introdu...
AbstractA bicircular matroid is a matroid defined on the edge set of a graph. Two different graphs c...
AbstractIn this paper we introduce a partial order on the elements of a matroid based on its fundame...
If G is a graph and C ${\buildrel \Delta\over =}$ $\{$E(B) $\mid$ B is a bicycle of G$\}$, then C is...
AbstractA generalized-network matrix is a matrix that has at most two nonzeros per column. The gener...
In this thesis, we deal with binet matrices, an extension of network matrices. The main result of th...
The incidence matrix of a graph is a fundamental object naturally appearing in many applications, in...
AbstractThis paper presents a polynomial-time algorithm for solving a restricted version of the reco...
Relations between discrete quantities such as people, genes, or streets can be described by networks...
não disponívelOur objective in this work is to study the problem of converting a given matrix to an ...
In this article, we propose a new type of square matrix associated with an undirected graph by tradi...
This article introduces a novel neural network framework for the approximate bilinear algorithm that...
We present a polynomial time algorithm to construct a bidirected graph for any totally unimodular ma...
We study four classical graph problems – Hamiltonian path, Traveling salesman, Minimum spanning tree...
In this work, we have made some modifications on the definition of the incidence matrices of a direc...
AbstractIn this and a subsequent paper (by R. Shull, A. Shuchat, J.B. Orlin and M. Lepp), we introdu...
AbstractA bicircular matroid is a matroid defined on the edge set of a graph. Two different graphs c...
AbstractIn this paper we introduce a partial order on the elements of a matroid based on its fundame...
If G is a graph and C ${\buildrel \Delta\over =}$ $\{$E(B) $\mid$ B is a bicycle of G$\}$, then C is...
AbstractA generalized-network matrix is a matrix that has at most two nonzeros per column. The gener...
In this thesis, we deal with binet matrices, an extension of network matrices. The main result of th...
The incidence matrix of a graph is a fundamental object naturally appearing in many applications, in...
AbstractThis paper presents a polynomial-time algorithm for solving a restricted version of the reco...
Relations between discrete quantities such as people, genes, or streets can be described by networks...
não disponívelOur objective in this work is to study the problem of converting a given matrix to an ...
In this article, we propose a new type of square matrix associated with an undirected graph by tradi...
This article introduces a novel neural network framework for the approximate bilinear algorithm that...
We present a polynomial time algorithm to construct a bidirected graph for any totally unimodular ma...
We study four classical graph problems – Hamiltonian path, Traveling salesman, Minimum spanning tree...
In this work, we have made some modifications on the definition of the incidence matrices of a direc...
DOI
Add to ORKG