Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Oversberg, A."'
The square of a graph $G$, denoted by $G^2$, is obtained from $G$ by putting an edge between two distinct vertices whenever their distance is two. Then $G$ is called a square root of $G^2$. Deciding whether a given graph has a square root is known to
Externí odkaz:
http://arxiv.org/abs/1410.2075
The square of a graph $G$, denoted $G^2$, is obtained from $G$ by putting an edge between two distinct vertices whenever their distance is two. Then $G$ is called a square root of $G^2$. Deciding whether a given graph has a square root is known to be
Externí odkaz:
http://arxiv.org/abs/1402.0024
Publikováno v:
In Theoretical Computer Science 4 October 2016 648:26-33
Publikováno v:
In Theoretical Computer Science 18 October 2015 602:39-49
Publikováno v:
In Discrete Applied Mathematics 20 August 2014 173:83-91
Publikováno v:
In Operations Research for Health Care June-September 2012 1(2-3):34-44
Publikováno v:
Theoretical Computer Science. 648:26-33
The square of a graph G, denoted by G 2 , is obtained from G by putting an edge between two distinct vertices whenever their distance is two. Then G is called a square root of G 2 . Deciding whether a given graph has a square root is known to be NP-c
Publikováno v:
Discrete Applied Mathematics. 173:83-91
The square of a graph G , denoted by G 2 , is the graph obtained from G by putting an edge between two distinct vertices whenever their distance in G is at most 2 . Motwani and Sudan proved that it is NP -complete to decide whether a given graph is t
Publikováno v:
Operations research for health care, 1(2-3), 34-44. Elsevier Science & Technology
Hospitals aim to deliver the highest quality of care. One key priority is to schedule emergency surgeries as quickly as possible, because postponing them generally increases a patient's risk of complications. In this paper, we consider the case that