Polynomial Time Recognition of Uniform Cocircuit Graphs |
| |
| Affiliation: | 1. Department of Mathematics, CINVESTAV-Querétaro, Apdo. Postal 1-798, Arteaga 5, 76000 Santiago de Querétaro, Qro., Mexico;2. Department of Mathematics, ITAM, Rio Hondo #1, Col. Progreso Tizapán, México, DF 01080, México |
| |
| Abstract: | We present an algorithm which takes a graph as input and decides in polynomial time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algorithm returns the set of signed cocircuits of the oriented matroid. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
