scientific article; zbMATH DE number 17815

MaRDI QIDQ3975159zbMATH OpenFDO

Authors Christoph Meinel

Publication date 26 June 1992

zbMATH Keywords

\(p\)-projection reducibilitybranching programcompleteness

Mathematics Subject Classification ID

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

Cited in

(19)

• Transitivity of local complementation and switching on graphs.
• Global view on reactivity: switch graphs and their logics
• Complexity of vertex switching on edge-bicolored graphs
• Graph switching, 2-ranks, and graphical Hadamard matrices
• Some switching invariant prime graphs
• On a connection between the switching separability of a graph and that of its subgraphs
• scientific article; zbMATH DE number 4209586 (Why is no real title available?)
• scientific article; zbMATH DE number 4055051 (Why is no real title available?)
• scientific article; zbMATH DE number 4057569 (Why is no real title available?)
• scientific article; zbMATH DE number 8782 (Why is no real title available?)
• scientific article; zbMATH DE number 125469 (Why is no real title available?)
• Switching in one-factorisations of complete graphs
• Switching graphs
• Reachability switching games
• Reachability Switching Games
• On the Complexity of Bounded Context Switching.
• Switchings, extensions, and reductions in central digraphs
• An Algorithmic Study of Switch Graphs
• An algorithmic study of switch 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 Q3975159)