Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/autre/graph-theoretic-concepts-in-computer-science/golumbic/descriptif_2909221
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=2909221

0 article 

 Frais de port 0,01€*

Exclusivité web : à partir de 35 euros d’achat, frais de port à 1 centime pour les expéditions vers la France métropolitaine, la Suisse et l’UE avec Colissimo ou GLS

Graph-Theoretic Concepts in Computer Science, 2012 38th International Workshop, WG 2012, Jerusalem, Israel, June 26-28, 2012, Revised Selcted Papers Theoretical Computer Science and General Issues Series

Langue : Anglais

Coordonnateurs : Golumbic Martin Charles, Stern Michael, Levy Avivit, Morgenstern Gila

Couverture de l’ouvrage Graph-Theoretic Concepts in Computer Science
This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition

Account on Intervals.- Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerance.- Alternating Reachabillity and Integer Sum of Closed Alternating Trails: The 3rd Annual Uri N. Peled Memorial Lecture.- Triangulation and Clique Separator Decomposition of Claw-Free Graphs.- Minimum Weighted Clique Cover on Strip-Composed Perfect Graphs.- Graph Isomorphism for Graph Classes Characterized by Two Forbidden Induced Subgraphs.- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area.- The Duals of Upward Planar Graphs on Cylinders.- On the Minimum Degree Up to Local Complementation: Bounds and Complexity.- Bisections above Tight Lower Bounds.- Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications.- Hydras: Directed Hypergraphs and Horn Formulas.- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill.- Maximum Induced Multicliques and Complete Multipartite Subgraphs in Polygon-Circle Graphs and Circle Graphs.- Parameterized Domination in Circle Graphs.- On the Parameterized Complexity of Finding Separators with Non-hereditary Properties.

Fast conference proceedings

State-of-the-art report

Up to date results

Date de parution :

Ouvrage de 346 p.

15.5x23.5 cm

Disponible chez l'éditeur (délai d'approvisionnement : 15 jours).

Prix indicatif 52,74 €

Ajouter au panier