scientific article; zbMATH DE number 512932

zbMath0925.05051MaRDI QIDQ4281647

Alain Cournier, Michel A. Habib

Publication date: 9 June 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (19)

A \(k\)-structure generalization of the theory of 2-structures ⋮ An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures ⋮ Decomposability index of tournaments ⋮ Minimal indecomposable graphs ⋮ Decomposition tree of a lexicographic product of binary structures ⋮ Birecognition of prime graphs, and minimal prime graphs ⋮ Indecomposability graph and indecomposability recognition ⋮ The \(C_{3}\)-structure of the tournaments. ⋮ Recognition of prime graphs from a prime subgraph ⋮ The simplicity index of tournaments ⋮ A tight lower bound for primitivity in k-structures ⋮ Prime orientable graphs ⋮ Nesting of prime substructures in \(k-\)ary relations ⋮ Critically indecomposable graphs ⋮ Editing to prime graphs ⋮ The recognition of the class of indecomposable digraphs under low hemimorphy ⋮ Indecomposability graph and critical vertices of an indecomposable graph ⋮ Modular decomposition and transitive orientation ⋮ Some Algorithms on Conditionally Critical Indecomposable Graphs

This page was built for publication: