the proceedings contain 32 papers. the special focus in this conference is on graph-theoreticconcepts in computerscience. the topics include: Fast Winning Strategies for the Attacker in Eternal Domina...
ISBN:
(纸本)9783031754081
the proceedings contain 32 papers. the special focus in this conference is on graph-theoreticconcepts in computerscience. the topics include: Fast Winning Strategies for the Attacker in Eternal Domination;independent Set Reconfiguration in H-Free graphs;enumerating Minimal Solution Sets for Metric graph Problems;Feedback Vertex Set for Pseudo-disk graphs in Subexponential FPT Time;oriented Trees in O(kk)-Chromatic Digraphs, a Subquadratic Bound for Burr’s Conjecture;improved Outerplanarity Bounds for Planar graphs;XNLP-Hardness of Parameterized Problems on Planar graphs;augmenting Plane Straight-Line graphs to Meet Parity Constraints;covering a graph with Minimal Local Sets;a New Approach for Approximating Directed Rooted Networks;approximations and Hardness of Covering and Packing Partially Ordered Items;beyond Recognizing Well-Covered graphs;untangling Gaussian Mixtures;face-Hitting Dominating Sets in Planar graphs;the Parameterized Complexity Landscape of the Unsplittable Flow Problem;lightweight Near-Additive Spanners;finite Vertex-Colored Ultrahomogeneous Oriented graphs;recognition of Unit Segment and Polyline graphs is ∃R-Complete;roman Cycle Hitting Set;popular Solutions for Optimal Matchings;degreewidth on Semi-complete Digraphs;on the Connectivity of the Flip graph of Plane Spanning Paths;graph Reconstruction with Connectivity Queries;on Polynomial Kernelization for Stable Cutset;revisiting Path Contraction and Cycle Contraction;many Views of Planar Point Sets;on the Complexity of Simultaneous Geometric Embedding for Edge-Disjoint graphs;finding d-Cuts in graphs of Bounded Diameter, graphs of Bounded Radius and H-Free graphs;exact and Approximate k-planarity Testing for Maximal graphs of Small Pathwidth;the Complexity of Diameter on H-free graphs.
the proceedings contain 22 papers. the special focus in this conference is on graph-theoreticconcepts in computerscience. the topics include: A simple implementation of Warshall's algorithm on a vlsi chip;on som...
ISBN:
(纸本)9783540172185
the proceedings contain 22 papers. the special focus in this conference is on graph-theoreticconcepts in computerscience. the topics include: A simple implementation of Warshall's algorithm on a vlsi chip;on some generalizations of outerplanar graphs: Results and open problems;recognizing outerplanar graphs in linear time;graphs and graph polynomials of interest in chemistry;applications of parallel scheduling to perfect graphs;a graph-theoretic approach for designing fair distributed resource scheduling algorithms;improved diameter bounds for altered graphs;separability of sets of polygons;centipede graphs and visibility on a cylinder;on approximation algorithms for Steiner's problem in graphs;the diameter of connected components of random graphs;an algorithm for testing planarity of hierarchical graphs;EDM — A data model for electronic CAD/CAM-applications;specification of error distances for graphs by precedence graph grammars and fast recognition of similarity;ADA concurrency specified by graph grammars;cabri, an interactive system for graph manipulation;an interactive graphical manipulation system for higher objects based on relational algebra;behaviour preserving refinements of Petri nets;the bandwidth of planar distributive lattices;the node visit cost of brother trees.
the proceedings contain 32 papers. the special focus in this conference is on graph-theoreticconcepts in computerscience. the topics include: A lower bound for treewidth and its consequences;tree-width and path-widt...
ISBN:
(纸本)3540590714
the proceedings contain 32 papers. the special focus in this conference is on graph-theoreticconcepts in computerscience. the topics include: 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;the algorithmic use of hypertree structure and maximum neighbourhood orderings;on domination elimination orderings and domination graphs;complexity of graph covering problems;GLB-closures in directed acyclic graphs and their applications;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;time-optimal tree computations on sparse meshes;the complexity of broadcasting in planar and decomposable graphs;book embeddings and crossing numbers;labelled trees and pairs of input-output permutations in priority queues;bypass strong v-structures and find an isomorphic labelled subgraph in linear time;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;NC algorithms for antidirected Hamiltonian paths and cycles in tournaments and directed pathgraph isomorphism.
the proceedings contain 30 papers. the topics discussed include: graph-theoretic solutions to computational geometry problems;algorithms for classes of graphs with bounded expansion;a graph polynomial arising from com...
ISBN:
(纸本)3642114083
the proceedings contain 30 papers. the topics discussed include: graph-theoretic solutions to computational geometry problems;algorithms for classes of graphs with bounded expansion;a graph polynomial arising from community structure;maximum series-parallel subgraph;the parameterized complexity of some minimum label problems;exact and parameterized algorithms for max internal spanning tree;an exact algorithm for minimum distortion embedding;parameterized complexity of generalized domination problems;connected feedback vertex set in planar graphs;logical locality entails frugal distributed computation over graphs;an even simpler linear-time algorithm for verifying minimum spanning trees;local algorithms for edge colorings in UDGs;graph partitioning and traffic grooming with bounded degree request graph;a new intersection model and improved algorithms for tolerance graphs;and counting the number of matchings in chordal and chordal bipartite graph classes.
the proceedings contain 19 papers. the special focus in this conference is on graph-theoreticconcepts in computerscience. the topics include: Approximate counting, uniform generation and rapidly mixing markov chains...
ISBN:
(纸本)9783540194224
the proceedings contain 19 papers. the special focus in this conference is on graph-theoreticconcepts in computerscience. the topics include: Approximate counting, uniform generation and rapidly mixing markov chains extended abstract;on chaotic behaviour of some np-complete problems;external labeling and algorithms for hierarchic networks;designing gamma-acyclic database schemes using decomposition and augmentation techniques;graph-theoretical tools and their use in a practical distributed operating system design case;development of several reachability algorithms for directed graphs;on integration mechanisms within a graph-based software development environment;restructuring aspect graphs into aspect- and cell-equivalence classes for use in computer vision;automatic crystal chemical classification of silicates using direction-labeled graphs;a PrT-net representation of graph grammars;pretty patterns produced by hyperedge replacement;graph languages defined by systems of forbidden structures: A survey;a sweepcircle algorithm for Voronoi diagrams: Extended abstract;competitive location in the L1and Linfmetrics;priority search trees in secondary memory (extended abstract);on the analysis of grid structures for spatial objects of non-zero size;maintenance of transitive closures and transitive reductions of graphs.
the proceedings contain 26 papers. the special focus in this conference is on graph-theoreticconcepts in computerscience. the topics include: Optimal parallel algorithms for sparse graphs;finding minimally weighted ...
ISBN:
(纸本)9783540538325
the proceedings contain 26 papers. the special focus in this conference is on graph-theoreticconcepts in computerscience. the topics include: Optimal parallel algorithms for sparse graphs;finding minimally weighted subgraphs;on the complexity of some coloring games;a generalized best-first search method in graphs;avoiding matrix multiplication;induced subgraph isomorphism for cographs is NP-complete;on feedback problems in planar digraphs;vertex-disjoint trees and boundary single-layer routing;bounds on the quality of approximate solutions to the group Steiner problem;two polynomial problems in PLA folding;the VLSI layout problem in various embedding models;deterministic message routing in faulty hypercubes;on complexity of a message-routing strategy for multicomputer systems;embeddings of treelike graphs into 2-dimensional meshes;remarks on some concurrency measures;on the rectilinear art gallery problem algorithmic aspects;separation problems and circular arc systems;genus of orders and lattices;comparing the expressibility of two languages formed using NP-complete graph operators;decomposition of linear recursive logic programs;on the transition graphs of automata and grammars.
the proceedings contain 28 papers. the topics discussed include: algorithmic barriers from phase transitions in graphs;algorithmic graph minors and bidimensionality;complexity results for the spanning tree congestion ...
ISBN:
(纸本)3642169252
the proceedings contain 28 papers. the topics discussed include: algorithmic barriers from phase transitions in graphs;algorithmic graph minors and bidimensionality;complexity results for the spanning tree congestion problem;the longest path problem is polynomial on cocomparability graphs;colorings with few colors: counting, enumeration and combinatorial bounds;on stable matchings and flows;computing the cutwidth of bipartite permutation graphs in linear time;solving capacitated dominating set by using covering by subsets and maximum matching;efficient algorithms for eulerian extension;on the small cycle transversal of planar graphs;milling a graph with turn costs: a parameterized complexity perspective;graphs that admit right angle crossing drawings;kernelization hardness of connectivity problems in d-degenerate graphs;and on the Boolean-width of a graph: structure and applications.
the proceedings contain 30 papers. the topics discussed include: structures and hyperstructures in metabolic networks;important separators and parameterized algorithms;split clique graph complexity;on searching for sm...
ISBN:
(纸本)9783642258695
the proceedings contain 30 papers. the topics discussed include: structures and hyperstructures in metabolic networks;important separators and parameterized algorithms;split clique graph complexity;on searching for small Kochen-Specker vector systems;characterizations of deque and queue graphs;graph classes with structured neighborhoods and algorithmic applications;the cinderella game on holes and anti-holes;on the complexity of planar covering of small graphs;approximability of economic equilibrium for housing markets with duplicate houses;planarization and acyclic colorings of subcubic claw-free graphs;list coloring in the absence of a linear forest;parameterized complexity of Eulerian deletion problems;restricted cuts for bisections in solid grids: a proof via polygons;maximum independent set in 2-direction outersegment graphs;and empires make cartography hard: the complexity of the empire coloring problem.
暂无评论