Counting Markov Types, Balanced Matrices, and Eulerian Graphs

IEEE Transactions on Information Theory - United States
doi 10.1109/tit.2012.2191476
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Analysis of Markov Influence Graphs

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
2019English

Signed Domination of Graphs and (0,1)-Matrices

Contemporary Mathematics
Mathematics
2010English

Mobile Application for Practising Matrices and Graphs

Journal of Technology and Information Education
2020English

Counting Binary Matrices With Given Row and Column Sums

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1987English

Extremal Properties of Balanced Tri-Diagonal Matrices

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1969English

Space-Efficient Counting in Graphs on Surfaces

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2009English

Laplacian Matrices and Spanning Trees of Tree Graphs

Annales de la faculté des sciences de Toulouse Mathématiques
2017English

Relative Entropy Between Markov Transition Rate Matrices

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1993English

Packing, Counting and Covering Hamilton Cycles in Random Directed Graphs

Israel Journal of Mathematics
Mathematics
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy