A Graph Theoretical Approach for Reconstruction and Generation of Oriented Matroids

@inproceedings{Lthi2001AGT,
  title={A Graph Theoretical Approach for Reconstruction and Generation of Oriented Matroids},
  author={Hans-Jakob L{\"u}thi and Prof Komei and Manuel G{\"u}nter and T Ziegler},
  year={2001}
}
xv Zusammenfassung xvii Structure Diagram xix 
9 Extracted Citations
11 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 11 references

Counting and listing, Lecture Notes

  • K. FUKUDA
  • Swiss Federal Institute of Technology,
  • 2001

KRASSER: The point set order type data base: a collection of applications and results, Manuscript

  • H. O. A ICHHOLZER
  • 2001

SLOANE: On-line encyclopedia of integer sequences, http://www.research.att.com/ ̃njas/sequences/index.html

  • J A.N.
  • 2001

Reconstructing a non-simple polytope from its graph, in: Polytopes—combinatorics and computation (Oberwolfach

  • M. JOSWIG
  • 1997

KLEINSCHMIDT: Convex polytopes and related complexes

  • K LEEP.V.
  • in: Handbook of combinatorics,
  • 1995

RICHTER-GEBERT: On the classification of nonrealizable oriented matroids, Preprint Nr

  • J. J. BOKOWSKI
  • Technische Hochschule,
  • 1990

POLLACK: Multidimensional sorting,SIAM

  • R.J.E. GOODMAN
  • J. Comput.12
  • 1983

AS VERGNAS: Oriented matroids as signed geometries real in corank 2, in: Finite and infinite sets

  • M L
  • 1981

LAS VERGNAS: Minty colorings and orientations of matroids, in:Second

  • M.R.G. BLAND
  • International Conference on Combinatorial…
  • 1978

Similar Papers

Loading similar papers…