Algorithms and Computations 6th International Symposium, ISAAC '95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings. - neues Buch

EAN (ISBN-13): 9783540605737
ISBN (ISBN-10): 3540605738
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1995
Herausgeber: Springer
440 Seiten
Gewicht: 0,696 kg

Buch in der Datenbank seit 2007-06-26T13:31:22+02:00 (Zurich)
Detailseite zuletzt geändert am 2023-06-06T18:58:03+02:00 (Zurich)
ISBN/EAN: 9783540605737

ISBN - alternative Schreibweisen:
3-540-60573-8, 978-3-540-60573-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: john staple, john moffat, katoh, eades, alistair moffat, staples, geometry
Titel des Buches: algorithms computation, computer notes, cairns, 1004, symposium notes, science notes

---

Daten vom Verlag:

Autor/in: John Staples; Peter Eades; Naoki Katoh; Alistair Moffat
Titel: Lecture Notes in Computer Science; Algorithms and Computations - 6th International Symposium, ISAAC '95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings.
Verlag: Springer; Springer Berlin
450 Seiten
Erscheinungsjahr: 1995-11-15
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XVIII, 450 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; 3-SAT; Algorithmen; Algorithmic Mathematics; Algorithmische Mathematik; Algorithms; Combinatories; Erfüllbarkeitsproblem der Aussagenlogik; Graph Algorithms; Graph-Algorithmen; Komplexität; Partition; coding; complexity; geometry; optimization; algorithm analysis and problem complexity; combinatorics; Theory of Computation; Algorithms; Discrete Mathematics; Probability Theory; Statistics; Algorithmen und Datenstrukturen; Diskrete Mathematik; Wahrscheinlichkeitsrechnung und Statistik; Stochastik; EA

Algorithmic problems arising from Genome informatics.- An approximation algorithm for alphabet indexing problem.- A fast and space-economical algorithm for length-limited coding.- Computing in linear time a chord from which a simple polygon is weakly internally visible.- Competitive searching in polygons—Beyond generalised streets.- Finding a shortest pair of paths on the plane with obstacles and crossing areas.- Logspace verifiers, NC, and NP.- Structure in average case complexity.- Some geometric lower bounds.- The I/O-complexity of Ordered Binary-Decision Diagram manipulation.- Two arc disjoint paths in Eulerian digraphs.- Finding dense subgraphs.- Finding smallest supertrees.- Weighted domination on cocomparability graphs.- The parallel complexity of approximating the High Degree Subgraph problem.- Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs.- Greedy approximations of independent sets in low degree graphs.- Practical logic.- An approximation algorithm for MAX 3-SAT.- Learning of restricted RNLC graph languages.- Optimal information delivery.- On the complexity of testing for catastrophic faults.- Scheduling parallel tasks with individual deadlines.- Orders of Gauss periods in finite fields.- A hard problem that is almost always easy.- Computing the Tutte polynomial of a graph of moderate size.- More efficient parallel flow algorithms.- Linear-time in-place selection in less than 3n comparisons.- Heap construction: Optimal in both worst and average cases?.- Fast approximate dictionary matching.- Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract).- Searching for a monotone function by independent threshold queries.- A fast and simple algorithm foridentifying 2-monotonic positive Boolean functions.- Deciding bisimulation and trace equivalences for systems with many identical processes.- Should Amdahl's Law be repealed?.- Embeddings of hyper-rings in hypercubes.- A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets.- Algorithms for finding f-colorings of partial k-trees.- Spanning closed trail and hamiltonian cycle in grid graphs.- A linear time algorithm for finding maximal planar subgraphs.- Illumination with orthogonal floodlights.- No quadrangulation is extremely odd.- Finding the medial axis of a simple polygon in linear time.- The first subquadratic algorithm for complete linkage clustering.- Matching nuts and bolts faster.- Linear matching-time algorithm for the directed graph isomorphism problem.- A resource assignment problem on graphs.- NC algorithms for partitioning sparse graphs into induced forests with an application.