A linear-time recognition algorithm for P 4-reducible graphs (original) (raw)

On extended P4-reducible and extended P4-sparse graphs

Vassilis Giakoumakis

Theoretical Computer Science, 1997

View PDFchevron_right

Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation

Stavros D. Nikolopoulos

Algorithmica, 2004

View PDFchevron_right

A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs

Stavros D. Nikolopoulos

Springer eBooks, 2006

View PDFchevron_right

A Note on the Recognition of Nested Graphs

Mark Korenblit

2009

View PDFchevron_right

On a unique tree representation for P4-extendible graphs

Beverly Jamison

Discrete Applied Mathematics, 1991

View PDFchevron_right

Tree representations of graphs

Jozef Skokan

European Journal of Combinatorics, 2007

View PDFchevron_right

A V2 algorithm for determining isomorphism of planar graphs

Robert Tarjan

Information Processing Letters, 1971

View PDFchevron_right

Efficient parallel recognition algorithms of cographs and distance hereditary graphs

Elias Dahlhaus

Discrete Applied Mathematics, 1995

View PDFchevron_right

A linear-time algorithm for isomorphism of a subclass of chordal graphs

Veni Madhavan C. E.

Information Processing Letters, 1992

View PDFchevron_right

A representation for the modular-pairs of a P4-reducible graph by modular decomposition

Jayme Szwarcfiter

Electronic Notes in Discrete Mathematics, 2005

View PDFchevron_right

A fully dynamic algorithm for the recognition of -sparse graphs

Stavros D. Nikolopoulos

Theoretical Computer Science, 2012

View PDFchevron_right

Recognizing Clique Graphs of Directed and Rooted Path Graphs

Erich Prisner

Discrete Applied Mathematics, 1999

View PDFchevron_right

A pr 2 01 6 Polynomial-time algorithm for determining the graph isomorphism

Anatoly D Plotnikov

2016

View PDFchevron_right

A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

Guillaume Damiand

Theoretical Computer Science, 2001

View PDFchevron_right

On the Recognition of Bipolarizable and P_4-simplicial Graphs

Stavros D. Nikolopoulos

Discrete Mathematics & Theoretical Computer Science, 2005

View PDFchevron_right

A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs

Ryuhei Uehara

Journal of Computer Science and Technology, 2009

View PDFchevron_right

Advances in Graph Algorithms

ton kloks

2014

View PDFchevron_right

Canonical Forms for General Graphs Using Rooted Trees - Correctness and Complexity Study of the SCOTT Algorithm

Emmanuel Frénod

2020

View PDFchevron_right

Recognizing clique graphs of directed edge path graphs

Marisa GUTIERREZ

Discrete Applied Mathematics, 2003

View PDFchevron_right

Polynomial-time algorithm for determining the graph isomorphism (v.2)

Anatoly D Plotnikov

2016

View PDFchevron_right

Polynomial-time algorithm for determining the graph isomorphism

Anatoly D Plotnikov

View PDFchevron_right

Recognizing [h, 2, 1] graphs

Marisa GUTIERREZ

2011

View PDFchevron_right

A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs

Stavros D. Nikolopoulos

Graphs and Combinatorics, 2010

View PDFchevron_right

Recognition and Optimization Algorithms for P5-Free Graphs

Victor Lepin

Symmetry, 2020

View PDFchevron_right

Parallel Algorithms for Recognizing P 5 -free and -free Weakly Chordal Graphs

Stavros D. Nikolopoulos

Parallel Processing Letters, 2004

View PDFchevron_right

An Approach of Graph Isomorphism Detection based on Vertex-Invariant

VIJAYA BALPANDE

2015

View PDFchevron_right

Recognizing Graph Search Trees

Robert Scheffler

Electronic Notes in Theoretical Computer Science, 2019

View PDFchevron_right

A log-space algorithm for canonization of planar graphs

Prajakta Nimbhorkar

2008

View PDFchevron_right

Recognizing Bipolarizable and P 4-Simplicial Graphs

Stavros D. Nikolopoulos

Lecture Notes in Computer Science, 2003

View PDFchevron_right

Graph Recognition by Seriation and Frequent Substructures Mining

Antonello Rizzi

2012

View PDFchevron_right

On Algorithms for (P5,Gem)-Free Graphs

Hans Bodlaender

2003

View PDFchevron_right

Recognition algorithm for intersection graphs of edge disjoint paths in a tree

Saraju P Mohanty

Information Processing Letters, 1994

View PDFchevron_right

Polynomial time and space exact and heuristic algorithms for determining the generators, orbits and order of the graph automorphism group

Stoicho Stoichev

arXiv (Cornell University), 2010

View PDFchevron_right

Linear-Time Graph Algorithms in GP 2

Detlef Plump

2019

View PDFchevron_right

Clique tree generalization and new subclasses of chordal graphs

Veni Madhavan C. E.

Discrete Applied Mathematics, 2002

View PDFchevron_right