A bijective proof of an identity for noncrossing graphs.

Pavel Podbrdský

Published in: Discret. Math. (2003)

Keyphrases

queueing systems
transition probabilities
graph matching
markov chain
theorem prover
graph mining
markov models
search space
directed graph
maximum entropy
graph structure
weighted graph