Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
![]() |
![]() ![]() |
Ultima descărcare din IBN: 2017-04-26 18:58 |
Căutarea după subiecte similare conform CZU |
519.17 (68) |
Combinatorial analysis. Graph theory (115) |
![]() GRIGORIU, Nicolae. Construction of a transitive orientation using B-stable subgraphs. In: Computer Science Journal of Moldova, 2015, nr. 1(67), pp. 11-23. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 1(67) / 2015 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 519.17 | ||||||
Pag. 11-23 | ||||||
|
||||||
![]() |
||||||
Rezumat | ||||||
A special method for construction of transitive orientations of the undirected graph $G=(X;U)$ is proposed. The method uses an iterative procedure for factorization of graph $G$. Factorization procedure consists in replacing of a B-stable subgraph with a vertex. Transitive orientations are obtained by a polynomial time algorithm which is presented in the paper.
|
||||||
Cuvinte-cheie stable subgraph, B-stable subgraph, transitive orientation, graph factor. |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-36898</cfResPublId> <cfResPublDate>2015-04-30</cfResPublDate> <cfVol>67</cfVol> <cfIssue>1</cfIssue> <cfStartPage>11</cfStartPage> <cfISSN>1561-4042</cfISSN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/36898</cfURI> <cfTitle cfLangCode='EN' cfTrans='o'>Construction of a transitive orientation using B-stable subgraphs</cfTitle> <cfKeyw cfLangCode='EN' cfTrans='o'>stable subgraph; B-stable subgraph; transitive orientation; graph factor.</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'>A special method for construction of transitive orientations of the undirected graph $G=(X;U)$ is proposed. The method uses an iterative procedure for factorization of graph $G$. Factorization procedure consists in replacing of a B-stable subgraph with a vertex. Transitive orientations are obtained by a polynomial time algorithm which is presented in the paper. </cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2015-04-30T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2015-04-30T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-25748</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2015-04-30T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-25748</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-25748-3</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2015-04-30T24:00:00</cfStartDate> <cfFamilyNames>Grigoriu</cfFamilyNames> <cfFirstNames>Nicolae</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>