Theory and Applications of Models of Computation
Springer Berlin (Verlag)
978-3-642-13561-3 (ISBN)
Plenary Talks.- New Research Directions in the Information Age.- The Laplacian Paradigm: Emerging Algorithms for Massive Graphs.- Special Sessions.- Proof Complexity of Non-classical Logics.- Optimal Acceptors and Optimal Proof Systems.- The Complexity of Geometric Problems in High Dimension.- Different Approaches to Proof Systems.- Algebraic Proofs over Noncommutative Formulas.- Contributed Papers.- Nonlocal Quantum XOR Games for Large Number of Players.- Nontriviality for Exponential Time w.r.t. Weak Reducibilities.- Streaming Algorithms for Some Problems in Log-Space.- Temperature Aware Online Scheduling with a Low Cooling Factor.- On Solution Concepts for Matching Games.- Binary De Bruijn Partial Words with One Hole.- Complexity Invariance of Real Interpretations.- Pivot and Loop Complementation on Graphs and Set Systems.- Revisiting the Minimum Breakpoint Linearization Problem.- An -time Algorithm for the Minimal Interval Completion Problem.- Centdian Computation for Sensor Networks.- Twisted Jacobi Intersections Curves.- L(2,1,1)-Labeling Is NP-Complete for Trees.- Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs.- The Max k-Cut Game and Its Strong Equilibria.- Kernel and Fast Algorithm for Dense Triplet Inconsistency.- Incremental List Coloring of Graphs, Parameterized by Conservation.- Schnyder Greedy Routing Algorithm.- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width.- A Note on the Testability of Ramsey's Class.- Deterministic Polynomial-Time Algorithms for Designing Short DNA Words.- Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult.- A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions.- Graph Sharing Games: Complexity and Connectivity.- A VisualModel of Computation.- An Automata-Theoretic Characterization of the Chomsky-Hierarchy.- Maximum Independent Set in Graphs of Average Degree at Most Three in .- Simultaneity in Event Structures.- Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable.- Closed Rectangle-of-Influence Drawings for Irreducible Triangulations.- Recovering Social Networks from Contagion Information.- Two-Layer Planarization Parameterized by Feedback Edge Set.- A Categorical View of Timed Weak Bisimulation.- Community Structure in Large Complex Networks.- Generating Internally Triconnected Rooted Plane Graphs.
Erscheint lt. Verlag | 20.5.2010 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | XIV, 480 p. 91 illus. |
Verlagsort | Berlin |
Sprache | englisch |
Gewicht | 742 g |
Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
Schlagworte | Algebra • Algorithm analysis and problem complexity • algorithms • Bipartite Graphs • coding theory • Complexity • Computability • constraints • Diffusion • Eulerian paths • geometric routing • graph coloring • Lower Bounds • non-uniformity • Planar Graphs • polynomial time • sorting • spanning tree • sparse graphs • transversal structure |
ISBN-10 | 3-642-13561-7 / 3642135617 |
ISBN-13 | 978-3-642-13561-3 / 9783642135613 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich