COMPUTATIONAL APPROACH IN PROVING THE NON-EXISTENCE OF FAMILIES OF ALMOST MOORE DIGRAPHS
(File Terlampir)
Saved in:
Main Author: | Simón Balcells, Sergi |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/77684 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
Similar Items
-
Almost minimum diameter orientations of semicomplete multipartite and extended digraphs
by: Gutin, G., et al.
Published: (2014) -
How to Prove the Existence of God from the Necessary Finitude of the Past
by: NOWACKI, Mark
Published: (2000) -
Proving non-termination by program reversal
by: CHATTERJEE, Krishnendu, et al.
Published: (2021) -
Interlacing families and the Hermitian spectral norm of digraphs
by: Greaves, Gary Royden Watson, et al.
Published: (2021) -
DIGRAPH EKSENTRIS DARI DIGRAPH
by: SULISTYOWATI, 089711567
Published: (2002)