| Articolul precedent |
| Articolul urmator |
 |
 193 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. |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Grigoriu, N.</dc:creator> <dc:date>2017</dc:date> <dc:description xml:lang='en'><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></dc:description> <dc:source>Conference on Applied and Industrial Mathematics (Ediţia 25) 31-32</dc:source> <dc:title>Reorientation of the transitive graphs</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>
|
|
|
