This volume constitutes the refereed proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012, held in Bratislava, Slovakia, in August 2012. The 63 revised full papers presented together with 8 invited talks were carefully reviewed and selected from 162 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.Among the various problems they study, they also observe that approximate graph isomorphisms between n vertex graphs can be ... years by the pattern matching community; see e.g. the survey article . That line ... We consider the following optimization problems: a Max-EGI: Given G1 , G2, find a bijection I: V 1 a V2 thatanbsp;...
|Title||:||Mathematical Foundations of Computer Science 2012|
|Author||:||Branislav Rovan, Vladimiro Sassone, Peter Widmayer|
|Publisher||:||Springer - 2012-08-01|