15 citations · 22 across the 11 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.CC2010
On Complexity of Isoperimetric Problems on Trees
Amir Daneshgar, Ramin Javadi
This paper is aimed to investigate some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters c…
math.CO2010★ 1 cited
Graph Coloring and Function Simulation
Amir Daneshgar, Ali Reza Rahimi, Siamak Taati
We prove that every partial function with finite domain and range can be effectively simulated through sequential colorings of graphs. Namely, we show that given a finite set $S=\{…