Computing transparently: The independent sets in a graph

DOI10.1007/S11047-010-9186-0MaRDI QIDQ537814zbMATH OpenOpenAlexFDO

Authors Tom Head

Publication date 23 May 2011

Published in Natural Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11047-010-9186-0

zbMATH Keywords

optical computingunconventional computinglight-based computingphoto-computingxerography

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• A fast parallel algorithm for the maximal independent set problem
• Constructing a Maximal Independent Set in Parallel
• scientific article; zbMATH DE number 219239
• Algorithms for maximum independent sets
• An efficient parallel algorithm for computing a large independent set in a planar graph

Cites work

• scientific article; zbMATH DE number 1088898 (Why is no real title available?)
• Rainbow sort: Sorting at the speed of light
• Solving the Hamiltonian path problem with a light-based computer

Cited in

(4)

• An optical solution for the set splitting problem
• Pumping lemmas for classes of languages generated by folding systems
• Using light to implement parallel Boolean algebra
• Computing with light: toward parallel Boolean algebra

This page was built for publication: Computing transparently: The independent sets in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537814)