Effectiveness of Vertex Nomination via Seeded Graph Matching to Find Bijections Between Similar Networks

Abstract

The purpose of this effort was to perform independent verification and validation of Vertex Nomination via Seeded Graph Matching, a graph analytic prototype developed under DARPA's XDATA program. The software was evaluated for its efficiency in applying principles of seeded graph matching to locating bijections among similar graphs. Contractor results were reproduced to verify integrity and an experiment was conducted to evaluate the performance of the software in a simplified environment where results were scored for various test cases. Issues and pitfalls in the underlying algorithms were pointed out along with areas of improvement for the current prototype.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 2018
Accession Number
AD1050319

Entities

People

  • Tyler Witter

Organizations

  • Rome Laboratory

Tags

Communities of Interest

  • Energy and Power Technologies
  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Accelerated Testing
  • Accuracy
  • Air Force
  • Air Force Research Laboratories
  • Algorithms
  • Bibliographies
  • Big Data
  • Biometric Security
  • Communities
  • Computer Programming
  • Contracts
  • Data Analysis
  • Detection
  • Efficiency
  • Environment
  • Government Procurement
  • Governments
  • Information Exchange
  • Iterations
  • Military Applications
  • Military Research
  • Probability
  • Prototypes
  • Spreadsheet Software
  • United States

Fields of Study

  • Computer science

Readers

  • Computational Modeling and Simulation
  • Graph Algorithms and Convex Optimization.
  • Software Engineering.