scientific article; zbMATH DE number 4213472
From MaRDI portal
Publication:3359786
zbMATH Open0733.68063MaRDI QIDQ3359786FDOQ3359786
Authors:
Publication date: 1990
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Cited In (14)
- Efficient parallel recognition of cographs
- Parallel Algorithm for Cograph Recognition with Applications
- Title not available (Why is that?)
- Parallel algorithm for cograph recognition with applications
- On parallel recognition of cographs
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
- An optimal parallel algorithm to construct a deap
- Parallel recognition of complement reducible graphs and cotree construction
- A faster parallel connectivity algorithm on cographs
- A fast parallel algorithm to recognize partitionable graphs
- Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
- Cograph generation with linear delay
- A simple linear time LexBFS cograph recognition algorithm.
- Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3359786)
