A new graph characteristic and its application to numerical computability

DOI10.1016/S0020-0190(00)00153-8MaRDI QIDQ1603419zbMATH OpenFDO

Authors Frank Harary, Vladik Kreinovich, Luc Longpré

Publication date 14 July 2002

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

graphstheory of computationcomputing with real numbers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3982510
• Complexity of computation on real algebraic numbers
• Zero tests for constants in simple scientific computation
• scientific article; zbMATH DE number 4026680
• Publication:3026349

Cites work

• scientific article; zbMATH DE number 3900744 (Why is no real title available?)
• scientific article; zbMATH DE number 4070894 (Why is no real title available?)
• scientific article; zbMATH DE number 3621713 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3291139 (Why is no real title available?)
• Computational complexity and feasibility of data processing and interval computations
• Parallel concepts in graph theory

Cited in

(1)

• scientific article; zbMATH DE number 5670538 (Why is no real title available?)

This page was built for publication: A new graph characteristic and its application to numerical computability

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