Ameneh Farhadian

activity

20162025

most citedA Simple Explanation for the Reconstruction of Graphs

1 citations · 2 across the 8 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018

A Simple Algorithm for a Computationally Hard Problem

Ameneh Farhadian

Graph isomorphism problem is a known hard problem. In this paper, a novel randomized algorithm is proposed for this problem which is very simple and fast. It solves the graph isomo…

math.CO2018

Almost every $n$ -vertex graph is determined by its $3 lo g_{2} n$ -vertex subgraphs

Ameneh Farhadian

The paper shows that almost every $n$ -vertex graph is such that the multiset of its induced subgraphs on $3 lo g_{2} n$ vertices is sufficient to determine it up to isomorphism. The…

A Simple Algorithm for a Computationally Hard Problem

Almost every n-vertex graph is determined by its 3log2​n-vertex subgraphs

Almost every $n$ -vertex graph is determined by its $3 lo g_{2} n$ -vertex subgraphs