A transformational development of several algorithms for testing the existence of cycles in a directed graph

Kreisstruktur und Färbungen gerichteter Graphen

Steiner, Raphael Mario

December 2021

This thesis deals with problems from the theory of finite directed graphs. A directed graph (digraph...

Cycle recognition in discrete dynamical systems: an algorithmic approach

Lohmann, Markus

January 1995

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

A computer based approach in determining the Hamiltonian cycle of a graph

Dimapilis, Anna Carina V.
Dy, Caroline K.

January 1993

This thesis introduces to the readers the basic characteristics of Hamiltonian cycles. Hamiltonian c...

Algorithmen zur Vergroeberung und Verfeinerung von netzartigen Diagrammen

Toussaint, I. (Gesellschaft fuer Mathematik und Datenverarbeitung m.b.H. Bonn, Sankt Augustin (Germany, F.R.). Inst. fuer Methodische Grundlagen)
Gesellschaft fuer Mathematik und Datenverarbeitung m.b.H. Bonn, St. Augustin (Germany, F.R.)

January 1984

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Some remarks on cycles in graphs and digraphs

Loebl, Martin
Matamala Vásquez, Martín

April 2001

Artículo de publicación ISIWe surveyseveral recent results on cycles of graphs and directed graphs o...

An algorithmic characterization of total digraphs

Skowronska, M.
Syslo, M.M.
Zamfirescu, C.
Bonn Univ. (Germany, F.R.). Inst. fuer Oekonometrie und Operations Research

January 1983

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Cycles through prescribed elements in a graph

Lomonosov, M. V.

January 1988

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Models of computation for graph theoretic problems

Turan, G.
Bonn Univ. (Germany, F.R.). Inst. fuer Oekonometrie und Operations Research

January 1983

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Some remarks on cycles in graphs and digraphs

Loebl, Martin
Matamala, Martin

April 2001

AbstractWe survey several recent results on cycles of graphs and directed graphs of the following fo...

Algorithms to Compute Minimum Cycle Basis in Directed Graphs

Telikepalli Kavitha
Kurt Mehlhorn

January 2005

We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n ...

Graphs whose cycles are of length r modulo k

Chang, Gerard J.
Wu, Chia-shyan

January 1986

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Algorithms for Directed Graphs

Hrelja, Mateo

July 2022

Usmjereni graf je matematički model i struktura podataka koji se formalno sastoji od skupa vrhova, t...

Testing Properties of Directed Graphs: Acyclicity and Connectivity

Michael A. Bender
Dana Ron

January 2002

This paper initiates the study of testing properties of directed graphs. In particular, the paper c...

A Polynomial Algorithm for Deciding Equivalence in Directed Cyclic Graphical Models

Thomas Richardson
Thomas Richardson
Thomas Richardson

January 1996

A polynomial algorithm for deciding equivalence in directed cyclic graphical model

A Polynomial Algorithm for Codes Based on Directed Graphs

Kelarev School Of

February 2008

A complete description and proof of correctness are given for a new polynomial time algorithm for a ...

Kreisstruktur und Färbungen gerichteter Graphen

Steiner, Raphael Mario

December 2021

This thesis deals with problems from the theory of finite directed graphs. A directed graph (digraph...

Cycle recognition in discrete dynamical systems: an algorithmic approach

Lohmann, Markus

January 1995

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

A computer based approach in determining the Hamiltonian cycle of a graph

Dimapilis, Anna Carina V.
Dy, Caroline K.

January 1993

This thesis introduces to the readers the basic characteristics of Hamiltonian cycles. Hamiltonian c...

Algorithmen zur Vergroeberung und Verfeinerung von netzartigen Diagrammen

Toussaint, I. (Gesellschaft fuer Mathematik und Datenverarbeitung m.b.H. Bonn, Sankt Augustin (Germany, F.R.). Inst. fuer Methodische Grundlagen)
Gesellschaft fuer Mathematik und Datenverarbeitung m.b.H. Bonn, St. Augustin (Germany, F.R.)

January 1984

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Some remarks on cycles in graphs and digraphs

Loebl, Martin
Matamala Vásquez, Martín

April 2001

Artículo de publicación ISIWe surveyseveral recent results on cycles of graphs and directed graphs o...

An algorithmic characterization of total digraphs

Skowronska, M.
Syslo, M.M.
Zamfirescu, C.
Bonn Univ. (Germany, F.R.). Inst. fuer Oekonometrie und Operations Research

January 1983

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Cycles through prescribed elements in a graph

Lomonosov, M. V.

January 1988

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Models of computation for graph theoretic problems

Turan, G.
Bonn Univ. (Germany, F.R.). Inst. fuer Oekonometrie und Operations Research

January 1983

SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...

Some remarks on cycles in graphs and digraphs

Loebl, Martin
Matamala, Martin

April 2001

AbstractWe survey several recent results on cycles of graphs and directed graphs of the following fo...

Algorithms to Compute Minimum Cycle Basis in Directed Graphs

Telikepalli Kavitha
Kurt Mehlhorn

January 2005

We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n ...

Graphs whose cycles are of length r modulo k

Chang, Gerard J.
Wu, Chia-shyan

January 1986

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

Algorithms for Directed Graphs

Hrelja, Mateo

July 2022

Usmjereni graf je matematički model i struktura podataka koji se formalno sastoji od skupa vrhova, t...

Testing Properties of Directed Graphs: Acyclicity and Connectivity

Michael A. Bender
Dana Ron

January 2002

This paper initiates the study of testing properties of directed graphs. In particular, the paper c...

A Polynomial Algorithm for Deciding Equivalence in Directed Cyclic Graphical Models

Thomas Richardson
Thomas Richardson
Thomas Richardson

January 1996

A polynomial algorithm for deciding equivalence in directed cyclic graphical model

A Polynomial Algorithm for Codes Based on Directed Graphs

Kelarev School Of

February 2008

A complete description and proof of correctness are given for a new polynomial time algorithm for a ...

Kreisstruktur und Färbungen gerichteter Graphen

Steiner, Raphael Mario

December 2021

This thesis deals with problems from the theory of finite directed graphs. A directed graph (digraph...

Cycle recognition in discrete dynamical systems: an algorithmic approach

Lohmann, Markus

January 1995

SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...

A computer based approach in determining the Hamiltonian cycle of a graph

Dimapilis, Anna Carina V.
Dy, Caroline K.

January 1993

This thesis introduces to the readers the basic characteristics of Hamiltonian cycles. Hamiltonian c...

A transformational development of several algorithms for testing the existence of cycles in a directed graph

Abstract

Extracted data

A transformational development of several algorithms for testing the existence of cycles in a directed graph

Abstract

Extracted data

Related items

Related items