scientific article; zbMATH DE number 562727

zbMATH Open0804.68058MaRDI QIDQ4290645FDOQ4290645

Authors: Tomoyuki Uchida, Satoru Miyano 

Publication date: 12 January 1995

Title of this publication is not available (Why is that?)

Recommendations

• The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
• The parallel complexity of approximating the High Degree Subgraph problem
• scientific article; zbMATH DE number 1107742
• The parallel complexity of approximating the high degree subgraph problem
• An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
• On parallel complexity of maximum \(f\)-matching and the degree sequence problem
• Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
• Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
• A parallelizable lexicographically first maximal edge-induced subgraph problem
• Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs

zbMATH Keywords

parallel algorithmvertex coloringEREW PRAMmaximal edge-induced subgraphmaximal vertex-induced subgraph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

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 Q4290645)