scientific article; zbMATH DE number 742958
From MaRDI portal
Publication:4763400
zbMath0814.05042MaRDI QIDQ4763400
Peter M. Winkler, Milena Mihail
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
countingEulerian graphTutte polynomialperfect matchingsEulerian orientationsEulerian toursmonotonicity lemmanear-perfect matchingsrandomized schemes
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45)
Related Items (10)
Random walks, totally unimodular matrices, and a randomised dual simplex algorithm ⋮ Unnamed Item ⋮ Counting degree-constrained subgraphs and orientations ⋮ Factor-of-iid balanced orientation of non-amenable graphs ⋮ Eulerian digraphs and toric Calabi-Yau varieties ⋮ A theory of even functionals and their algorithmic applications ⋮ Graphs with Many Strong Orientations ⋮ Covers, orientations and factors ⋮ Several constants arising in statistical mechanics ⋮ Approximating the number of monomer-dimer coverings of a lattice.
This page was built for publication:
