Titlebook: ;

怪物

Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms to three types: bijective, injective or surjective. If graph . has a homomorphism of given type to graph ., then we say that the degree refinement matrix of . is smaller than that of .. This way we obtain three partial orders. We present algorithms that will determine whether two matrices are compa

Foam-Cells

Network Discovery and Verificationer of queries. A query at a vertex?. discovers (or verifies) all edges and non-edges whose endpoints have different distance from?.. In the network discovery problem, the edges and non-edges are initially unknown, and the algorithm must select the next query based only on the results of previous que

Celiac-Plexus

Complete Graph Drawings Up to Triangle Mutationsdrawing when it is planar), and the sketch introduced by Courcelle (determining the drawing in general but assuming we know the order of the crossings on each edge). For a complete graph drawing, the subsketch is determined, through first order logic formulas, by the size, a corner of the drawing an

grotto

南極

Parameter

Induced Subgraphs of Bounded Degree and Bounded Treewidthnd every vertex in . has degree at most . in .. The order of . depends on ., ., ., and the order of .. With . = ., we obtain large sets of bounded degree vertices. With . = 0, we obtain large independent sets of bounded degree. In both these cases, our bounds on the order of . are tight. For bounded

帶來

Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Timearious domination powers. Broadcast domination assigns a power .(.) ≥ 0 to each vertex . of a given graph, such that every vertex of the graph is within distance .(.) from some vertex . having .(.) ≥ 1. The optimal broadcast domination problem seeks to minimize the sum of the powers assigned to the

碎石頭

Ultimate Generalizations of LexBFS and LEX Merfect elimination ordering) of a chordal graph, and corresponding algorithms which compute an meo (minimal elimination ordering) of a non-chordal graph..We express all known peo-computing search algorithms as instances of a generic algorithm called MLS (Maximal Label Search) and generalize Algorith

Flinch

Adding an Edge in a Cographwo non-adjacent vertices . and .) of ., finds the minimum number of edges that need to be added to the edge set of . such that the resulting graph is a cograph and contains the edge .. The motivation for this problem comes from algorithms for the dynamic recognition and online maintenance of graphs;

NOTCH