The even outdegree conjecture for acyclic PLCP-cubes in dimension five

Sonoko Moriyama, Yoshio Okamoto

研究成果: Article査読

抄録

The behavior of Bard-type pivoting algorithms for the linear complementarity problem with a P-matrix is represented by an orientation of a hypercube. We call it a PLCP-cube. In 1978, Stickney and Watson conjectured that such an orientation has no facet on which all even outdegree vertices appear. We prove that this conjecture is true for acyclic PLCP-cubes in dimension five.

本文言語English
ページ(範囲)2402-2404
ページ数3
ジャーナルIEICE Transactions on Information and Systems
E89-D
8
DOI
出版ステータスPublished - 2006 8

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

引用スタイル