Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
![]() |
![]() ![]() |
Ultima descărcare din IBN: 2019-01-31 12:56 |
Căutarea după subiecte similare conform CZU |
519.17 (68) |
Analiză combinatorică. Teoria grafurilor (116) |
![]() CATARANCIUC, Sergiu, MACOVEICIUC, Elisei. Location problems on d-convex simple planar graphs. In: Studia Universitatis Moldaviae (Seria Ştiinţe Exacte şi Economice), 2015, nr. 7(87), pp. 22-30. ISSN 1857-2073. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Studia Universitatis Moldaviae (Seria Ştiinţe Exacte şi Economice) | ||||||
Numărul 7(87) / 2015 / ISSN 1857-2073 /ISSNe 2345-1033 | ||||||
|
||||||
CZU: 519.17 | ||||||
Pag. 22-30 | ||||||
|
||||||
![]() |
||||||
Rezumat | ||||||
The article examines the center and median problems on graphs with special structure. In scientific works these are frequently called location problems on graphs. Although efficient solutions for graphs with some well-known properties have been found, in general case the problem remains complex. In this paper the structure of median and center in a d-convex simple planar graph G is studied. We evaluate the connection between median/center of a graph G with mentioned properties and median/center of a tree, determined by G. |
||||||
Cuvinte-cheie d-convex simple graph, location problems., median, center, Tree, distance |
||||||
|
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>Cataranciuc, S.G.</creatorName> <affiliation>Universitatea de Stat din Moldova, Moldova, Republica</affiliation> </creator> <creator> <creatorName>Macoveiciuc, E.</creatorName> <affiliation>Universitatea de Stat din Moldova, Moldova, Republica</affiliation> </creator> </creators> <titles> <title xml:lang='en'>Location problems on d-convex simple planar graphs</title> </titles> <publisher>Instrumentul Bibliometric National</publisher> <publicationYear>2015</publicationYear> <relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1857-2073</relatedIdentifier> <subjects> <subject>d-convex simple graph</subject> <subject>median</subject> <subject>center</subject> <subject>Tree</subject> <subject>distance</subject> <subject>location problems.</subject> <subject schemeURI='http://udcdata.info/' subjectScheme='UDC'>519.17</subject> </subjects> <dates> <date dateType='Issued'>2015-12-27</date> </dates> <resourceType resourceTypeGeneral='Text'>Journal article</resourceType> <descriptions> <description xml:lang='en' descriptionType='Abstract'>The article examines the center and median problems on graphs with special structure. In scientific works these are frequently called location problems on graphs. Although efficient solutions for graphs with some well-known properties have been found, in general case the problem remains complex. In this paper the structure of median and center in a d-convex simple planar graph G is studied. We evaluate the connection between median/center of a graph G with mentioned properties and median/center of a tree, determined by G.</description> <description xml:lang='ro' descriptionType='Abstract'>În articol este examinată problema centrului şi problema medianei, cunoscute în literatura de specialitate ca probleme de amplasare. Fiind, în caz general, probleme dificile, acestea se rezolvă în mod eficient pe structuri matematice speciale. În lucrare se prezintă un studiu complex cu privire la structura medianei şi centrului într-un graf planar d-convex simplu G. Este studiată legătura dintre mediana/centrul grafului şi mediana/centrul unui arbore, determinat de G. </description> </descriptions> <formats> <format>application/pdf</format> </formats> </resource>