Skip to main navigation
Skip to search
Skip to main content
Bar-Ilan University Home
Help & FAQ
Home
Researchers
Organisations
Research output
Prizes
Student theses
Courses
Activities
Projects
Press/Media
Datasets
Equipment
Search by expertise, name or affiliation
Composed Degree-Distance Realizations of Graphs
Amotz Bar-Noy
, David Peleg
, Mor Perry
,
Dror Rawitz
Bar-Ilan University - The Alexander Kofkin Faculty of Engineering
Computer Engineering
City University of New York
Weizmann Institute of Science
Academic College of Tel-Aviv - Yaffo
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Composed Degree-Distance Realizations of Graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Realization Problem
100%
Distance Realization
100%
Degree Distance
100%
Polynomial Time
50%
Network Parameters
50%
Weighted Graph
50%
Bipartite Graph
50%
Tree Graph
50%
NP-hardness
50%
Graph Classes
50%
Profile Type
50%
Permissible Value
50%
Realization Algorithm
50%
Unweighted Graph
50%
Network Realisation
50%
Computer Science
Bipartite Graph
100%
Tree Graph
100%
Polynomial Time
100%
Network Parameter
100%
Mathematics
Polynomial Time
100%
Bipartite Graph
100%