HOME > 상세정보

상세정보

Graph-theoretic concepts in computer science : 20th International Workshop, WG'94, Herrsching, Germany, June, 1994 : proceedings

Graph-theoretic concepts in computer science : 20th International Workshop, WG'94, Herrsching, Germany, June, 1994 : proceedings (1회 대출)

자료유형
단행본
개인저자
Mayr, Ernst W. Schmidt, Gunther. Tinhofer, Gottfried.
서명 / 저자사항
Graph-theoretic concepts in computer science : 20th International Workshop, WG'94, Herrsching, Germany, June, 1994 : proceedings / Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer, eds.
발행사항
Berlin :   Springer-Verlag,   1995.  
형태사항
ix, 414 p. : ill. ; 24 cm.
총서사항
Lecture notes in computer science ;. 903.
ISBN
3540590714
서지주기
Includes bibliographical references.
000 00918camuuu200229 a 4500
001 000000918150
005 19990119104426.0
008 960213s1995 gw a b 100 0 eng d
020 ▼a 3540590714
040 ▼a 244002 ▼c 244002
049 0 ▼l 151024912
082 0 4 ▼a 004.1 ▼2 20
090 ▼a 004.1 ▼b L471 ▼c 903
111 2 ▼a International Workshop on Graph-Theoretic Concepts in Computer Science ▼n (20th : ▼d 1994 : ▼c Herrsching, Germany)
245 1 0 ▼a Graph-theoretic concepts in computer science : ▼b 20th International Workshop, WG'94, Herrsching, Germany, June, 1994 : proceedings / ▼c Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer, eds.
260 ▼a Berlin : ▼b Springer-Verlag, ▼c 1995.
300 ▼a ix, 414 p. : ▼b ill. ; ▼c 24 cm.
440 0 ▼a Lecture notes in computer science ; ▼v . 903.
504 ▼a Includes bibliographical references.
700 1 ▼a Mayr, Ernst W.
700 1 ▼a Schmidt, Gunther.
700 1 ▼a Tinhofer, Gottfried.

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 세종학술정보원/과학기술실/ 청구기호 004.1 L471 903 등록번호 151024912 도서상태 대출가능 반납예정일 예약 서비스 C

컨텐츠정보

목차

Domino treewidth.- A lower bound for treewidth and its consequences.- Tree-width and path-width of comparability graphs of interval orders.- A declarative approach to graph based modeling.- Multilevel graph grammars.- The algorithmic use of hypertree structure and maximum neighbourhood orderings.- On domination elimination orderings and domination graphs.- Complexity of graph covering problems.- Dominoes.- GLB-closures in directed acyclic graphs and their applications.- Minimum vertex cover, distributed decision-making, and communication complexity.- Cartesian products of graphs as spanning subgraphs of de Bruijn graphs.- Specification of graph translators with triple graph grammars.- Using programmed graph rewriting for the formal specification of a configuration management system.- Exponential time analysis of confluent and boundary eNCE graph languages.- Time-optimal tree computations on sparse meshes.- Prefix graphs and their applications.- The complexity of broadcasting in planar and decomposable graphs.- The maximal f-dependent set problem for planar graphs is in NC.- On-line convex planarity testing.- Book embeddings and crossing numbers.- Measuring the distance to series-parallelity by path expressions.- Labelled trees and pairs of input-output permutations in priority queues.- Rankings of graphs.- Bypass strong V-structures and find an isomorphic labelled subgraph in linear time.- Efficient algorithms for a mixed k-partition problem of graphs without specifying bases.- Fugitive-search games on graphs and related parameters.- New approximation results on graph matching and related problems.- New lower bounds and hierarchy results for restricted branching programs.- On-line algorithms for satisfiability problems with uncertainty.- NC algorithms for antidirected hamiltonian paths and cycles in tournaments.- Directed path graph isomorphism.


정보제공 : Aladin

관련분야 신착자료

김자미 (2021)