| Articolul precedent |
| Articolul urmator |
 |
 195 0 |
 SM ISO690:2012GRIGORIU, Nicolae. Reorientation of the transitive graphs. In: Conference on Applied and Industrial Mathematics: CAIM 2017, 14-17 septembrie 2017, Iași. Chișinău: Casa Editorial-Poligrafică „Bons Offices”, 2017, Ediţia 25, pp. 31-32. ISBN 978-9975-76-247-2. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Conference on Applied and Industrial Mathematics Ediţia 25, 2017 |
||||||
|
Conferința "Conference on Applied and Industrial Mathematics" Iași, Romania, 14-17 septembrie 2017 | ||||||
|
||||||
| Pag. 31-32 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
Transitive graphs have many applications in computer science and many other theoretical and practical elds[1], [4]. Many of the NP-problems that have a transitive graph representation can be solved in polynomial time [3]. In this context it is important to have an optimal solution for reorientation of the transitive graph. |
||||||
|
DataCite XML Export
<?xml version='1.0' encoding='utf-8'?> <resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'> <creators> <creator> <creatorName>Grigoriu, N.</creatorName> <affiliation>Universitatea de Stat din Moldova, Moldova, Republica</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Reorientation of the transitive graphs</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2017</publicationYear> <relatedIdentifier relatedIdentifierType='ISBN' relationType='IsPartOf'> 978-9975-76-247-2</relatedIdentifier> <dates> <date dateType='Issued'>2017</date> </dates> <resourceType resourceTypeGeneral='Text'>Conference Paper</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'><p>Transitive graphs have many applications in computer science and many other theoretical and practical elds[1], [4]. Many of the NP-problems that have a transitive graph representation can be solved in polynomial time [3]. In this context it is important to have an optimal solution for reorientation of the transitive graph.</p></description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>
|
|
|
