12 citations · 23 across the 11 of their papers we have counts for
14 papers
Bounding the edge cover of a hypergraph
Farhad Shahrokhi
Let be a hypergraph. Let , then is an {\it edge cover}, or a {\it set cover}, if . A subset of vertices is {\it indepe…
A performance study of some approximation algorithms for minimum dominating set in a graph
Jonathan S. Li, Rohan Potru, Farhad Shahrokhi
We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm,…
Bounding the trace function of a hypergraph with applications
Farhad Shahrokhi
An upper bound on the trace function of a hypergraph is derived and its applications are demonstrated. For instance, a new upper bound for the VC dimension of , or ,…
A simple upper bound for trace function of a hypergraph with applications
Farhad Shahrokhi
Let be a hypergraph on the vertex set and edge set . We show that number of distinct {\it traces} on any subset of , is most $k.{\hat α…
Strong Pseudo Transitivity and Intersection Graphs
Farhad Shahrokhi
A directed graph is {\it strongly pseudo transitive} if there is a partition of so that graphs and are transitive, and additiona…
Unit Incomparability Dimension and Clique Cover Width in Graphs
Farhad Shahrokhi
For a clique cover in the undirected graph , the {\it clique cover graph} of is the graph obtained by contracting the vertices of each clique in into a single vertex…