Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

How to test a tree

From MaRDI portal
Publication:4540076
Jump to:navigation, search

DOI10.1002/(SICI)1097-0037(199810)32:3%3C189::AID-NET3%3E3.0.CO;2-GzbMATH Open1015.68019OpenAlexW2083564160MaRDI QIDQ4540076FDOQ4540076


Authors: Andrew B. Kahng, Gabriel Robins, Elizabeth A. Walkup Edit this on Wikidata


Publication date: 21 July 2002


Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199810)32:3%3C189::aid-net3%3E3.0.co;2-g




Recommendations

  • Diagnosis of Faults in Linear Tree Networks
  • Testability of convergent tree circuits
  • Connectivity testing
  • Diagnosis of a regular-structure processor network
  • scientific article; zbMATH DE number 522870


zbMATH Keywords

VLSI multichip module packaging


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Fault detection; testing in circuits and networks (94C12) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)



Cited In (2)

  • How to fit a tree in a box
  • Searching for faulty leaves in binary trees





This page was built for publication: How to test a tree

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4540076&oldid=18663381"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 10:19. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki