Year | Venue | Keywords |
---|---|---|
2010 | Electronic Colloquium on Computational Complexity (ECCC) | planar graph |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Planar straight-line graph,Chordal graph,Bipartite graph,Matching (graph theory),Cograph,3-dimensional matching,Pathwidth,Mathematics,Strong perfect graph theorem | Journal | 17 |
Citations | PageRank | References |
3 | 0.40 | 10 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Samir Datta | 1 | 200 | 19.82 |
Raghav Kulkarni | 2 | 172 | 19.48 |
Raghunath Tewari | 3 | 83 | 9.82 |