000 | 04465nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-540-69643-8 | ||
003 | DE-He213 | ||
005 | 20240423132506.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1997 gw | s |||| 0|eng d | ||
020 |
_a9783540696438 _9978-3-540-69643-8 |
||
024 | 7 |
_a10.1007/BFb0024481 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aGraph-Theoretic Concepts in Computer Science _h[electronic resource] : _b23rd International Workshop, WG'97, Berlin, Germany, June 18-20, 1997. Proceedings / _cedited by Rolf H. Möhring. |
250 | _a1st ed. 1997. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1997. |
|
300 |
_aX, 382 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1335 |
|
505 | 0 | _aGadgets, approximation, and linear programming: Improved hardness results for cut and satisfiability problems -- Non-oblivious local search for MAX 2-CCSP with application to MAX DICUT -- On the number of simple cycles in planar graphs -- On the separable-homogeneous decomposition of graphs -- Pseudo-hamiltonian graphs -- Acyclic orientations for deadlock prevention in interconnection networks -- Weak-order extensions of an order -- An upper bound for the maximum cut mean value -- NP-completeness results for minimum planar spanners -- Computing the independence number of dense triangle-free graphs -- Algorithms for the treewidth and minimum fill-in of HHD-free graphs -- Block decomposition of inheritance hierarchies -- Minimal elimination ordering inside a given chordal graph -- On-line algorithms for networks of temporal constraints -- Parallel algorithms for treewidth two -- On optimal graphs embedded into paths and rings, with analysis using l 1-spheres -- On greedy matching ordering and greedy matchable graphs -- Off-line and on-line call-scheduling in stars and trees -- Computational complexity of the Krausz dimension of graphs -- Asteroidal sets in graphs -- Complexity of colored graph covers I. Colored directed multigraphs -- A syntactic approach to random walks on graphs -- Bicliques in graphs II: Recognizing k-path graphs and underlying graphs of line digraphs -- Large networks with small diameter -- The bounded tree-width problem of context-free graph languages -- Structured programs have small tree-width and good register allocation -- A measure of parallelization for the lexicographically first maximal subgraph problems -- Make your enemies transparent -- Optimal fault-tolerant ATM-routings for biconnected graphs. | |
520 | _aThis book constitutes the strictly refereed post-workshop proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97, held in Berlin, Germany in June 1997. The volume presents 28 revised full papers carefully selected for inclusion in the book from 42 submissions. The papers address a variety of graph-theoretic issues relevant from the computer science point of view such as graph algorithms, cycles, graph decompositions, interconnection networks, local search, graph orderings, graph matching, graph languages, tree-width computation, etc. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 |
_aArtificial intelligence _xData processing. |
|
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aData Science. |
650 | 2 | 4 | _aDiscrete Mathematics. |
700 | 1 |
_aMöhring, Rolf H. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540637578 |
776 | 0 | 8 |
_iPrinted edition: _z9783662169605 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v1335 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/BFb0024481 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188352 _d188352 |