Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
Juraj Hromkovic, Juraj Hromkoviď, Manfred Nagl, Bernhard Westfechtel
Springer Science & Business Media, 2004. gada 21. dec. - 404 lappuses
During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C- puter Science was ingenuity in all theoretical aspects and applications of graph concepts, wherever applied. Within the last ten years, the development has strengthened in particular the topic of structural graph properties in relation to computational complexity. This workshop has become pivotal for the c- munity interested in these areas.An aimspeci?c to the 30thWG was to support the central role of WG in both of the prementioned areas on the one hand and on the other hand to promote its originally broader scope. The 30th WG was held at the Physikzentrum Bad Honnef, which serves as the main meeting point of the German Physical Society. It o?ers a secluded setting for research conferences, seminars, and workshops, and has proved to be especiallystimulatingforfruitful discussions.Talksweregiveninthenewlecture hall with a modern double rear projection, interactive electronic board, and full video conferencing equipment.
Lietotāju komentāri - Rakstīt atsauksmi
Ierastajās vietās neesam atraduši nevienu atsauksmi.
Citi izdevumi - Skatīt visu
additive adjacent algorithm applications approximation assignment assume belongs bimodule bipartite graph bound called child clique cograph coloring complexity components Computer condition connected consider consists construct contains corresponding cost cover cycle decomposition deﬁned deﬁnition denote depth determine directed Discrete distance dominating set edges example exists face ﬁrst ﬁxed function give given graph G Hence holds independent set induced input instance interval known label LBFS least leaves Lemma length Let G linear matching maximal maximum minimal minimum Moreover neighbor node Note obtained operations optimal orientation pair partition path perfect polynomial positive possible present problem Proof prove recognition reduction relation represents respectively root running sequence slicing solution solved spanning split steps subgraph subset Theorem Theory tree University upper values vertex vertices visited weight