Universal Traversal Sequences for Expander Graphs

Information Processing Letters - Netherlands
doi 10.1016/0020-0190(93)90199-j
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

Corrigendum: Edge-Disjoint Paths in Expander Graphs

SIAM Journal on Computing
MathematicsComputer Science
2001English

Universal Sequences

Applicable Algebra in Engineering, Communications and Computing
Applied MathematicsNumber TheoryAlgebra
1997English

Further Results on Performance Analysis for Compressive Sensing Using Expander Graphs

Conference Record of the Asilomar Conference on Signals, Systems and Computers
Computer NetworksSignal ProcessingCommunications
2007English

Universal H-Colourable Graphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2012English

Universal Exact Sequences for Torsion Theories

Banach Center Publications
1990English

Degree Sequences of Infinite Graphs

Journal of the London Mathematical Society
Mathematics
1981English

Crossing Numbers of Sequences of Graphs

English

Traversal Algorithm for Complete Coverage

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy