Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure

@article{Ando1996DecompositionOA,
  title={Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure},
  author={Kazutoshi Ando and Satoru Fujishige and Toshio Nemoto},
  journal={Discret. Appl. Math.},
  year={1996},
  volume={68},
  pages={237-248}
}
  • Kazutoshi Ando, Satoru Fujishige, Toshio Nemoto
  • Published in Discret. Appl. Math. 1996
  • Computer Science, Mathematics
  • Abstract A bidirected graph is a graph each arc of which has either two positive end-vertices (tails), two negative end-vertices (heads), or one positive end-vertex (a tail) and one negative end-vertex (a head). We define the strong connectivity of a bidirected graph as a generalization of the strong connectivity of an ordinary directed graph. We show that a bidirected graph is decomposed into strongly connected components and that a signed poset structure is naturally defined on the set of the… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-6 OF 6 CITATIONS