Finding the smallest H-subgraph in real weighted graphs and related problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4051 LNCS, Issue , 2006, Pages 262-273

  Vassilevska, Virginia ^a   Williams, Ryan ^a   Yuster, Raphael ^b  

^a Carnegie Mellon University   (United States)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; EDGE DETECTION; ENCODING (SYMBOLS);

EDGES; RANDOMIZED ALGORITHM; SUBGRAPH; VERTICES;

GRAPH THEORY;

EID: 33746359980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_24     Document Type: Conference Paper

References (23)

1. [AN96] N. Alon and M. Naor. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica, 16:434-449, 1996.
2. [AYZ95] N. Alon, R. Yuster, and U. Zwick. Color-coding. Journal of the ACM, 42:844-856, 1995.
3. [AYZ97] N. Alori, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmica, 17:209-223, 1997.
4. [BFPSS05] M. Bender, M. Farach-Colton, G. Pemmasani, S. Skiena, and P. Sumazin. Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms, 57(2):75-94, 2005.
5. [Ch05] T.M. Chan. All-Pairs Shortest Paths with Real Weights in O(n 3/log n) Time. In Proc. of the 9th WADS, Lecture Notes in Computer Science 3608, Springer (2005), 318-324.
6. [CN85] N. Chiba and L. Nishizeki. Arboricity and subgraph listing algorithms. SIAM Journal on Computing, 14:210-223, 1985.
7. [Cop97] D. Coppersmith. Rectangular matrix multiplication revisited. Journal of Complexity, 13:42-49, 1997.
8. [CW90] D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions. J. Symbol. Comput., 9:251-280, 1990.
9. [DF95] R.G. Downey and M.R. Fellows. Fixed-parameter tractability arid completeness II. On completeness for W[1]. Theoret. Comput. Sci., 141(1-2):109-131, 1995.
10. [EG04] F. Eisenbrand and F. Grandoni. On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci., 326(1-3):57-67, 2004.
11. [FKP01] U. Feige, G. Kortsarz and D. Peleg. The Dense k-Subgraph Problem. Algorithmica, 29(3):410-421, 2001.
12. [Fr76] M.L. Fredman. New bounds on the complexity of the shortest path problem. SIAM Journal on Computing, 5:49-60, 1976.
13. [Fr76a] M.L. Fredman. How good is the information theory bound in sorting? Theoret. Comput. Sci., 1:355-361, 1976.
14. [Ha98] J. Håstad. Clique is hard to approximate within n 1-ε. Acta Math., 182(1):105-142, 1998.
15. [HP98] X. Huang and V.Y. Pan. Fast rectangular matrix multiplications and applications. Journal of Complexity, 14:257-299, 1998.
16. [IR78] A. Itai and M. Rodeh. Finding a minimum circuit in a graph. SIAM Journal on Computing, 7:413-423, 1978.
17. [KKM00] T. Kloks, D. Kratsch, and H. Müller. Finding and counting small induced subgraphs efficiently. Inf. Process. Lett., 74(3-4):115-121, 2000.
18. [KL05] M. Kowaluk and A. Lingaa. LCA Queries in Directed Acyclic Graphs. In Proc. of the 32nd ICALP, Lecture Notes in Computer Science 3580, Springer (2005), 241-248.
19. [NP85] J. Nešetřil and S. Poljak. On the complexity of the subgraph problem. Comment. Math. Univ. Carolin., 26(2):415-419, 1985.
20. [PV91] J. Plehn and B. Voigt. Finding Minimally Weighted Subgraphs. In Proceedings of the 16th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Springer-Verlag, 1991.
21. [Sei95] R. Seidel. On the Ali-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs. J. Comput. Syst. Sci., 51(3):400-403, 1995.
22. [VW06] V. Vassilevska and R. Williams. Finding a maximum weight triangle in n3-δ time, with applications.: In Proceedings of the 38th Annual ACM Symposium on Theory of. Computing (STOC), to appear.
23. [YZ04] R. Yuster and U. Zwick. Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. In Proc. of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM/SIAM (2004), 247-253.