Recognition and optimization algorithms for co-triangulated graphs

Algorithmes des graphes : inférence des réseaux et optimisation dans les graphes planaires

Zhou, Hang

July 2015

Cette thèse porte sur deux sujets d’algorithmique des graphes. Le premier sujet est l’inférence de r...

Setup minimization techniques for comparability graphs

Schrader, R.
Faigle, U.
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)
Bonn Univ. (Germany). Sonderforschungsbereich 21 - Projektgruppe Theoretische Modelle

January 1985

SIGLETIB: RN 4052 (85380-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informati...

Graph Algorithms and Applications

May 2022

The mixture of data in real-life exhibits structure or connection property in nature. Typical data i...

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

Recognizing quasi-triangulated graphs

Spinrad, Jeremy P

March 2004

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

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

Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421)

Borradaile, Glencora
Klein, Philp
Mathieu, Claire

January 2014

This report documents the program and the outcomes of Dagstuhl Seminar 13421 "Algorithms for Optimiz...

A generalization of triangulated graphs

Conforti, M.
Cornuejols, G.
Kapoor, A.
Vuskovic, K
Padua Univ. (Italy). Dipartimento di Matematica Pura e Applicata

January 1995

This work was supported in part by NSF grants DDM-9201340, DDM-9001705Consiglio Nazionale delle Rice...

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

A parallel algorithm for minimum weighted colouring of triangulated graphs

Hoang, Chinh T.

January 1990

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

Etude algorithmique de certaines classes de graphes parfaits : les graphes de parité, les graphes i-triangulés, les graphes parfaits trois chromatiques

Burlet, Michel

September 1981

Universités : Université scientifique et médicale de Grenoble et Institut national polytechnique de ...

Hierarchical graph algorithms

Lengauer, T.
Universitaet des Saarlandes, Saarbruecken (Germany, F.R.). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet
Kaiserslautern Univ. (Germany, F.R.). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet
Saarland Univ., Saarbruecken (Germany). Fachbereich Angewandte Mathematik und Informatik
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)

January 1984

SIGLETIB: RO 1829 (1984,15) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

Sur des généralisations des graphes triangulés (application aux problèmes de satisfaction de contraintes)

HADJADJ AOUL, Lamia
JEGOU, Philippe

January 2003

Le cadre de cette thèse est de caractériser certaines classes de graphes ayant de bonnes propriétés ...

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 algorithms for solving the multi-objective problems on a graph and their complexity

Bui Minh Tri
Do Duy Chinh
Centre National de la Recherche Scientifique (CNRS), 38 - Saint-Martin-d'Heres (France). Informatique et Mathematiques Appliquees de Grenoble
Centre National de la Recherche Scientifique (CNRS), 38 - Saint-Martin-d'Heres (France). Atelier de Recherche sue les Techniques Mathematiques et Informatiques de Systemes

January 1984

SIGLECNRS RS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

Algorithmes des graphes : inférence des réseaux et optimisation dans les graphes planaires

Zhou, Hang

July 2015

Cette thèse porte sur deux sujets d’algorithmique des graphes. Le premier sujet est l’inférence de r...

Setup minimization techniques for comparability graphs

Schrader, R.
Faigle, U.
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)
Bonn Univ. (Germany). Sonderforschungsbereich 21 - Projektgruppe Theoretische Modelle

January 1985

SIGLETIB: RN 4052 (85380-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informati...

Graph Algorithms and Applications

May 2022

The mixture of data in real-life exhibits structure or connection property in nature. Typical data i...

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

Recognizing quasi-triangulated graphs

Spinrad, Jeremy P

March 2004

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

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

Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421)

Borradaile, Glencora
Klein, Philp
Mathieu, Claire

January 2014

This report documents the program and the outcomes of Dagstuhl Seminar 13421 "Algorithms for Optimiz...

A generalization of triangulated graphs

Conforti, M.
Cornuejols, G.
Kapoor, A.
Vuskovic, K
Padua Univ. (Italy). Dipartimento di Matematica Pura e Applicata

January 1995

This work was supported in part by NSF grants DDM-9201340, DDM-9001705Consiglio Nazionale delle Rice...

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

A parallel algorithm for minimum weighted colouring of triangulated graphs

Hoang, Chinh T.

January 1990

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

Etude algorithmique de certaines classes de graphes parfaits : les graphes de parité, les graphes i-triangulés, les graphes parfaits trois chromatiques

Burlet, Michel

September 1981

Universités : Université scientifique et médicale de Grenoble et Institut national polytechnique de ...

Hierarchical graph algorithms

Lengauer, T.
Universitaet des Saarlandes, Saarbruecken (Germany, F.R.). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet
Kaiserslautern Univ. (Germany, F.R.). Sonderforschungsbereich 124 VLSI Entwurfsmethoden und Parallelitaet
Saarland Univ., Saarbruecken (Germany). Fachbereich Angewandte Mathematik und Informatik
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)

January 1984

SIGLETIB: RO 1829 (1984,15) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informatio...

Sur des généralisations des graphes triangulés (application aux problèmes de satisfaction de contraintes)

HADJADJ AOUL, Lamia
JEGOU, Philippe

January 2003

Le cadre de cette thèse est de caractériser certaines classes de graphes ayant de bonnes propriétés ...

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 algorithms for solving the multi-objective problems on a graph and their complexity

Bui Minh Tri
Do Duy Chinh
Centre National de la Recherche Scientifique (CNRS), 38 - Saint-Martin-d'Heres (France). Informatique et Mathematiques Appliquees de Grenoble
Centre National de la Recherche Scientifique (CNRS), 38 - Saint-Martin-d'Heres (France). Atelier de Recherche sue les Techniques Mathematiques et Informatiques de Systemes

January 1984

SIGLECNRS RS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

Algorithmes des graphes : inférence des réseaux et optimisation dans les graphes planaires

Zhou, Hang

July 2015

Cette thèse porte sur deux sujets d’algorithmique des graphes. Le premier sujet est l’inférence de r...

Setup minimization techniques for comparability graphs

Schrader, R.
Faigle, U.
Bonn Univ. (Germany). Inst. fuer Oekonometrie und Operations Research
Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany)
Bonn Univ. (Germany). Sonderforschungsbereich 21 - Projektgruppe Theoretische Modelle

January 1985

SIGLETIB: RN 4052 (85380-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informati...

Graph Algorithms and Applications

May 2022

The mixture of data in real-life exhibits structure or connection property in nature. Typical data i...

Recognition and optimization algorithms for co-triangulated graphs

Abstract

Extracted data

Recognition and optimization algorithms for co-triangulated graphs

Abstract

Extracted data

Related items

Related items