scientific article; zbMATH DE number 140480

MaRDI QIDQ4028898zbMATH OpenFDO

Authors Gur Saran Adhar, Shietung Peng

Publication date 28 March 1993

zbMATH Keywords

dominating setparallel algorithmsperfect graphisomorphismcographstransitive orientationminimum fill-inNC algorithmparity graphweighted cliquecographs recognitionminimal chain

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)

Recommendations

• Parallel algorithms for cographs and parity graphs with applications
• Parallel Algorithm for Cograph Recognition with Applications
• Parallel recognition of complement reducible graphs and cotree construction
• Parallel algorithm for cograph recognition with applications
• Efficient parallel recognition of cographs

Cited in

(5)

• Parallel algorithms for cographs and parity graphs with applications
• scientific article; zbMATH DE number 3896983 (Why is no real title available?)
• A Linear Recognition Algorithm for Cographs
• Efficient parallel recognition of cographs
• On parallel recognition of cographs

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