The STUDIA UNIVERSITATIS BABE┼×-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

 
       
         
    STUDIA INFORMATICA - Issue no. 2 / 2015  
         
  Article:   ALGORITHMIC APPROACH IN REORIENTATION OF COMPARABILITY GRAPHS.

Authors:  .
 
       
         
  Abstract:   In this article we present methods and algorithms for arcs reorientation in a transitive orientation of a comparability graph. These methods are based on special classes of subgraphs called B-stable sub-graphs. A stable subgraph F of the undirected graph G = (X;U) is called B-stable if F has no common vertices with any other stable sugraph M of G or F is proper subgraph of M. Algorithms of the reorientation of arcs are based on the factorization procedure.

2010 Mathematics Subject Classi fication. 05C17, 05C20.
Key words and phrases. graph factor, B-stable subgraph, transitively orientable graph.
 
         
     
         
         
      Back to previous page