scientific article; zbMATH DE number 742958

zbMATH Open0814.05042MaRDI QIDQ4763400FDOQ4763400

Authors: Milena Mihail, Peter Winkler 

Publication date: 11 April 1995

Title of this publication is not available (Why is that?)

Recommendations

• On the number of Eulerian orientations of a graph
• Sampling Eulerian orientations of triangular lattice graphs
• scientific article; zbMATH DE number 2127753
• Markov chain algorithms for Eulerian orientations and 3-colourings of 2-dimensional Cartesian grids
• Random sampling of Euler tours

zbMATH Keywords

perfect matchingscountingTutte polynomialEulerian graphEulerian orientationsEulerian toursmonotonicity lemmanear-perfect matchingsrandomized schemes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Enumeration in graph theory (05C30)

Cited In (22)

• Counting the Eulerian orientations of one class of circulant graphs
• Title not available (Why is that?)
• Counting degree-constrained subgraphs and orientations
• Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
• Exact counting of Euler tours for generalized series-parallel graphs
• Random sampling of Euler tours
• Counting planar Eulerian orientations
• Approximating the number of monomer-dimer coverings of a lattice.
• Title not available (Why is that?)
• FPT algorithms exploiting carving decomposition for Eulerian orientations and ice-type models
• Factor-of-iid balanced orientation of non-amenable graphs
• Oriented Euler complexes and signed perfect matchings
• Counting Euler tours in undirected bounded treewidth graphs
• Eulerian digraphs and toric Calabi-Yau varieties
• Graphs with many strong orientations
• Covers, orientations and factors
• Asymptotic behavior of the number of Eulerian orientations of graphs
• Several constants arising in statistical mechanics
• Markov chain algorithms for Eulerian orientations and 3-colourings of 2-dimensional Cartesian grids
• On the Query Complexity of Testing Orientations for Being Eulerian
• On the number of dissimilar pfaffian orientations of graphs
• A theory of even functionals and their algorithmic applications

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763400)