Add to ORKGA polynomial algorithm for deciding equivalence in directed cyclic graphical model
Following the lead of Stanley and Gessel, we consider a linear map which associates to an acyclic di...
Abstract. For evaluating polynomial curves in computer design the usual algorithm is the de Castelja...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
A complete description and proof of correctness are given for a new polynomial time algorithm for a ...
AbstractWe prove that the problem of deciding whether two graphs are switching equivalent is polynom...
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of t...
We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic o...
Discrete statistical models supported on labeled event trees can be specified using so-called interp...
This report documents the programme and outcomes of Dagstuhl Seminar 19401 ``Comparative Theory for ...
We present a polynomial algorithm, implicit in the work of El-Zahar and Sauer, which inputs a 3-colo...
The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cyc...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given gr...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
This paper is concerned with a class of parallel computations which can be represented by a graphica...
Following the lead of Stanley and Gessel, we consider a linear map which associates to an acyclic di...
Abstract. For evaluating polynomial curves in computer design the usual algorithm is the de Castelja...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...
A complete description and proof of correctness are given for a new polynomial time algorithm for a ...
AbstractWe prove that the problem of deciding whether two graphs are switching equivalent is polynom...
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of t...
We present a new polynomial-time algorithm for determining whether two given graphs are isomorphic o...
Discrete statistical models supported on labeled event trees can be specified using so-called interp...
This report documents the programme and outcomes of Dagstuhl Seminar 19401 ``Comparative Theory for ...
We present a polynomial algorithm, implicit in the work of El-Zahar and Sauer, which inputs a 3-colo...
The perception of cyclic structures is a crucial step in the analysis of graphs. To describe the cyc...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given gr...
AbstractLet P(G) denote the chromatic polynomial of a graph G. Two graphs G and H are chromatically ...
This paper is concerned with a class of parallel computations which can be represented by a graphica...
Following the lead of Stanley and Gessel, we consider a linear map which associates to an acyclic di...
Abstract. For evaluating polynomial curves in computer design the usual algorithm is the de Castelja...
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite d...