Kun-Mao Chao
Discrete Mathematics and Its Applications · with Wu · 2004
A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 1 researcher here, as inferred from the citation graph.
Whom Kun-Mao Chao trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Kun-Mao Chao overall
Papers from Kun-Mao Chao's perspective
Ordered by how strongly the researchers Kun-Mao Chao trusts endorse each paper. Same corpus, a different order for every researcher.
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A minimum spanning tree algorithm with inverse-Ackermann type complexity (JACM)
- An optimal minimum spanning tree algorithm (JACM)
- Pattern classification and scene analysis
- Whole-genome annotation by using evidence integration in functional-linkage networks. (Proceedings of the National Academy of Sciences of the United States of America)
- On variants of the Johnson–Lindenstrauss lemma (Random Struct. Algorithms)
- Gene Expression Omnibus: NCBI gene expression and hybridization array data repository (Nucleic Acids Res.)
- Information Theory and Statistics
- New directions in traffic measurement and accounting (CCRV)
- Monte Carlo Sampling Methods Using Markov Chains and Their Applications
Their papers
- Spanning trees and optimization problems (2004) — 321 citations