Fast Enumeration Algorithms for Non-crossing Geometric Graphs

ISSN： 0179-5376

Source： Discrete & Computational Geometry, Vol.42, Iss.3, 2009-10, pp. : 443-468

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Non-Crossing Frameworks with Non-Crossing Reciprocals

By Orden David Rote Günter Santos Francisco Servatius Brigitte Servatius Herman Whiteley Walter

Discrete & Computational Geometry, Vol. 32, Iss. 4, 2004-11 ,pp. : 567-600

Springer Publishing Company

Access to resources Recommend Favorite

Simply Generated Non-Crossing Partitions

Combinatorics, Probability & Computing, Vol. 26, Iss. 4, 2017-07 ,pp. : 560-592

Cambridge University Press

Access to resources Recommend Favorite

Enumeration of non-positive planar trivalent graphs

By Westbury Bruce

Journal of Algebraic Combinatorics, Vol. 25, Iss. 4, 2007-06 ,pp. : 357-373

Springer Publishing Company

Access to resources Recommend Favorite

A basis for the non-crossing partition lattice top homology

By Zoque Eliana

Journal of Algebraic Combinatorics, Vol. 23, Iss. 3, 2006-05 ,pp. : 231-242

Springer Publishing Company

Access to resources Recommend Favorite

Enumerating Constrained Non-crossing Minimally Rigid Frameworks

By Avis David Katoh Naoki Ohsaki Makoto Streinu Ileana Tanigawa Shin-ichi

Discrete & Computational Geometry, Vol. 40, Iss. 1, 2008-07 ,pp. : 31-46

Springer Publishing Company

Access to resources Recommend Favorite