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
Graph realizations: Maximum degree in vertex neighborhoods
Amotz Bar-Noy
, Keerti Choudhary
, David Peleg
,
Dror Rawitz
Bar-Ilan University - The Alexander Kofkin Faculty of Engineering
Computer Engineering
City University of New York
Indian Institute of Technology Delhi
Weizmann Institute of Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Graph realizations: Maximum degree in vertex neighborhoods'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Maximum Degree
100%
Vertex Neighbourhood
100%
Graph Realization
100%
Tight
50%
Linear Time
50%
Polynomial Time
50%
Simple Graph
50%
Non-negative Integer
50%
Degree Profile
50%
Neighborhood Degree
50%
Natural Settings
50%
Realization Problem
50%
Mathematics
Maximum Degree
100%
Null
50%
Approximates
50%
Simple Graph
50%
Nonnegative Integer
50%
Polynomial Time
50%
Linear Time
50%
Computer Science
Polynomial Time
100%
Nonnegative Integer
100%