Arboricity, h-index, and dynamic algorithms

Theoretical Computer Science

Volumn 426-427, Issue , 2012, Pages 75-90

  Lin, Min Chih ^a   Soulignac, Francisco J ^a   Szwarcfiter, Jayme L ^b  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Arboricity; Cop win graphs; Data structures; Diamond free graphs; Dynamic algorithms; h index; Strongly chordal graphs

Indexed keywords

ARBORICITY; COP-WIN GRAPHS; DIAMOND-FREE GRAPHS; DYNAMIC ALGORITHMS; H INDICES; STRONGLY CHORDAL GRAPH;

ALGORITHMS; DATA STRUCTURES; DIAMONDS; GRAPHIC METHODS; INDEXING (OF INFORMATION); PROBLEM SOLVING;

GRAPH THEORY;

EID: 84857913562     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.12.006     Document Type: Article

References (23)

1. N. Alon, R. Yuster, and U. Zwick Finding and counting given length cycles Algorithmica 17 3 1997 209 223 (Pubitemid 127440916)
2. H.-J. Bandelt, and E. Prisner Clique graphs and Helly graphs J. Combin. Theory Ser. B 51 1 1991 34 45
3. B. Bollobs Extremal Graph Theory 2004 Dover Publications Inc Mineola, NY (reprint of the 1978 original)
4. N. Chiba, and T. Nishizeki Arboricity and subgraph listing algorithms SIAM J. Comput. 14 1 1985 210 223
5. K 4 - e) -free perfect graphs and star cutsets B. Simeone, Combinatorial Optimization Como, 1986 Lecture Notes in Math. vol. 1403 1989 Springer Berlin 236 253
6. D. Coppersmith, and S. Winograd Matrix multiplication via arithmetic progressions J. Symbolic Comput. 9 3 1990 251 280
7. F. Eisenbrand, and F. Grandoni On the complexity of fixed parameter clique and dominating set Theoret. Comput. Sci. 326 13 2004 57 67
8. D. Eppstein, and E.S. Spiro The h-index of a graph and its application to dynamic subgraph statistics F.K.H.A. Dehne, M.L. Gavrilova, J.-R. Sack, C.D. Tth, Algorithms and Data Structures 11th International Symposium, WADS 2009, Banff, Canada, August 2123, 2009. Proceedings Lecture Notes in Computer Science vol. 5664 2009 Springer 278 289
9. M. Farber Characterizations of strongly chordal graphs Discrete Math. 43 23 1983 173 189 10.1016/0012-365X(83)90154-1 URL: http://dx.doi.org/10.1016/ 0012-365X(83)90154-1
10. K 4 \ e -free graphs Rev. Maghrbine Math. 2 1 1993 1 26
11. T. Kloks, D. Kratsch, and H. Mller Finding and counting small induced subgraphs efficiently Inform. Process. Lett. 74 34 2000 115 121
12. N-V.R. Mahadev, and T.M.- Wang On uniquely intersectable graphs Discrete Math. 207 1999 149 159
13. R. Nowakowski, and P. Winkler Vertex-to-vertex pursuit in a graph Discrete Math. 43 23 1983 235 239
14. R. Paige, and R.E. Tarjan Three partition refinement algorithms SIAM J. Computing 16 6 1987 973 989
15. T. Poston, Fuzzy Geometry, Ph.D. Thesis, University of Warwick, 1971.
16. A. Quilliot, Homomorphismes, points fixes, rtractions et jeux de poursuite dans les graphes, les ensembles ordonns et les espaces mtriques, Ph.D. Thesis, Universit de Paris VI, France, 1983.
17. J.P. Spinrad Doubly lexical ordering of dense 0-1 matrices Inform. Process. Lett. 45 1993 229 235
18. J.P. Spinrad Efficient graph representations Fields Institute Monographs vol.-19 2003 American Mathematical Society Providence, RI
19. J.P. Spinrad Recognizing quasi-triangulated graphs Discrete Appl. Math. 138 12 2004 203 213
20. J.L. Szwarcfiter A survey on clique graphs C. Linhares Sales, B. Reed, Recent Advances in Algorithms and Combinatorics CMS Books Math./Ouvrages Math. SMC vol.-11 2003 Springer New York 109 136
21. M. Talmaciu, and E. Nechita Recognition algorithm for diamond-free graphs Informatica (Vilnius) 18 3 2007 457 462
22. K 4 - e) -free graphs J. Combin. Theory Ser. B 42 3 1987 313 318
23. V. Vassilevska, Efficient algorithms for path problems in weighted graphs, Ph.D. Thesis, School of Computer Science, Carnegie Mellon University, August 2008.