The complexity of recognizing weakly triangulated graphs that are perfectly orderable

On the complexity of recognizing perfectly orderable graphs

Middendorf, Matthias
Pfeiffer, Frank

March 1990

AbstractThe question whether a polynomial time recognition algorithm for the class of perfectly orde...

Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Meister, Daniel

March 2005

AbstractA chordal graph H is a triangulation of a graph G if H is obtained by adding edges to G. If ...

Some properties of minimal imperfect graphs

Hoang, Chinh T.

January 1991

Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...

The complexity of recognizing weakly triangulated graphs that are perfectly orderable

Hoang, C.T.
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Alexander von Humboldt-Stiftung (AvH), Bonn (Germany)
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)

January 1990

SIGLETIB: RN 4052(89638-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

On the complexity of recognizing perfectly orderable graphs

Middendorf, M.
Pfeiffer, Frank

January 1989

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

Which claw-free graphs are perfectly orderable?

Chvatal, Vasek

January 1990

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

Recognition of some perfectly orderable graph classes

M. Eschen, Elaine
L. Johnson, Julie
P. Spinrad, Jeremy
Sritharan, R

June 2003

AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...

Recognition and optimization algorithms for co-triangulated graphs

Hoang, C.T.
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research

January 1990

SIGLETIB: RN 4052(90637-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

On the complexity of recognizing a class of perfectly orderable graphs

Hoàng, Chính T.

May 1996

AbstractRecently Middendorf and Pfeiffer proved that recognizing perfectly orderable graphs is NP-co...

The critical complexity of graph properties

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...

Algorithms for weakly triangulated graphs

Spinrad, Jeremy
Sritharan, R.

May 1995

AbstractWe present improved algorithms for the recognition and the weighted versions of the optimiza...

Recognizing quasi-triangulated graphs

Spinrad, Jeremy P

March 2004

AbstractThis paper discusses a method for recognizing certain graph classes based on elimination sch...

Which claw-free graphs are perfectly orderable

Chvatal, V.
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research

January 1990

SIGLETIB: RN 4052(90653-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

Die Komplexität der Enthaltenseinprobleme für rekurrente Systeme und minimale Triangulationen

Meister, Daniel

January 2006

The dissertation thesis studies the complexity of membership problems. Generally, membership problem...

Weak bipolarizable graphs

Olariu, Stephan

December 1989

AbstractWe characterize a new class of perfectly orderable graphs and give a polynomial-time recogni...

On the complexity of recognizing perfectly orderable graphs

Middendorf, Matthias
Pfeiffer, Frank

March 1990

AbstractThe question whether a polynomial time recognition algorithm for the class of perfectly orde...

Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Meister, Daniel

March 2005

AbstractA chordal graph H is a triangulation of a graph G if H is obtained by adding edges to G. If ...

Some properties of minimal imperfect graphs

Hoang, Chinh T.

January 1991

Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...

The complexity of recognizing weakly triangulated graphs that are perfectly orderable

Hoang, C.T.
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Alexander von Humboldt-Stiftung (AvH), Bonn (Germany)
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)

January 1990

SIGLETIB: RN 4052(89638-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

On the complexity of recognizing perfectly orderable graphs

Middendorf, M.
Pfeiffer, Frank

January 1989

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

Which claw-free graphs are perfectly orderable?

Chvatal, Vasek

January 1990

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

Recognition of some perfectly orderable graph classes

M. Eschen, Elaine
L. Johnson, Julie
P. Spinrad, Jeremy
Sritharan, R

June 2003

AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...

Recognition and optimization algorithms for co-triangulated graphs

Hoang, C.T.
Bonn Univ. (Germany). Forschungsinstitut fuer Diskrete Mathematik
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research

January 1990

SIGLETIB: RN 4052(90637-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

On the complexity of recognizing a class of perfectly orderable graphs

Hoàng, Chính T.

May 1996

AbstractRecently Middendorf and Pfeiffer proved that recognizing perfectly orderable graphs is NP-co...

The critical complexity of graph properties

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...

Algorithms for weakly triangulated graphs

Spinrad, Jeremy
Sritharan, R.

May 1995

AbstractWe present improved algorithms for the recognition and the weighted versions of the optimiza...

Recognizing quasi-triangulated graphs

Spinrad, Jeremy P

March 2004

AbstractThis paper discusses a method for recognizing certain graph classes based on elimination sch...

Which claw-free graphs are perfectly orderable

Chvatal, V.
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research

January 1990

SIGLETIB: RN 4052(90653-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

Die Komplexität der Enthaltenseinprobleme für rekurrente Systeme und minimale Triangulationen

Meister, Daniel

January 2006

The dissertation thesis studies the complexity of membership problems. Generally, membership problem...

Weak bipolarizable graphs

Olariu, Stephan

December 1989

AbstractWe characterize a new class of perfectly orderable graphs and give a polynomial-time recogni...

On the complexity of recognizing perfectly orderable graphs

Middendorf, Matthias
Pfeiffer, Frank

March 1990

AbstractThe question whether a polynomial time recognition algorithm for the class of perfectly orde...

Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Meister, Daniel

March 2005

AbstractA chordal graph H is a triangulation of a graph G if H is obtained by adding edges to G. If ...

Some properties of minimal imperfect graphs

Hoang, Chinh T.

January 1991

Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...

The complexity of recognizing weakly triangulated graphs that are perfectly orderable

Abstract

Extracted data

The complexity of recognizing weakly triangulated graphs that are perfectly orderable

Abstract

Extracted data

Related items

Related items