On the Encoding of Relations by Graphs

DOI10.1137/0605054MaRDI QIDQ3346319zbMATH OpenOpenAlexFDO

Authors Yoram Moses, Amos Noy

Publication date 1984

Published in SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0605054

zbMATH Keywords

encoding of k-ary relations by graphs

Mathematics Subject Classification ID

Other classical set theory (including functions, relations, and set algebra) (03E20) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 177437
• scientific article; zbMATH DE number 7724214
• Defining relations for deterministic graphs
• Relations on hypergraphs
• The Complexity of Defining a Relation on a Finite Graph
• Publication:4722086
• On graphs and codes
• scientific article; zbMATH DE number 4164896
• scientific article; zbMATH DE number 867695

Cites work

• A spectrum hierarchy
• scientific article; zbMATH DE number 3216216 (Why is no real title available?)

Cited in

(6)

• Linearity is strictly more powerful than contiguity for encoding graphs
• Defining relations for deterministic graphs
• Linearity is strictly more powerful than contiguity for encoding graphs
• Optimal Monotone Encodings
• Short Encodings of Evolving Structures
• Minimal storage representations for binary relations

This page was built for publication: On the Encoding of Relations by Graphs

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