Titlebook: ;

Precursor

On Minimum Connecting Transition Sets in Graphs,cutively in a walk in the graph. In this paper, we look for the smallest set of transitions needed to be able to go from any vertex of the given graph to any other. We prove that this problem is NP-hard and study approximation algorithms. We develop theoretical tools that help to study this problem.

一瞥

Recognizing Hyperelliptic Graphs in Polynomial Time,aph algorithms and number theory. We consider so-called . (multigraphs of gonality 2) and provide a safe and complete set of reduction rules for such multigraphs, showing that we can recognize hyperelliptic graphs in time ., where . is the number of vertices and . the number of edges of the multigra

艱苦地移動(dòng)

刺穿

,Optimality Program in Segment and?String Graphs,is very likely to be asymptotically best on general graphs. Intrigued by an algorithm packing curves in . by Fox and Pach [SODA’11], we investigate which problems have subexponential algorithms on the intersection graphs of curves (string graphs) or segments (segment intersection graphs) and which p

monochromatic

Anagram-Free Chromatic Number Is Not Pathwidth-Bounded,s note, we show that there are planar graphs of pathwidth 3 with arbitrarily large anagram-free chromatic number. More specifically, we describe 2.-vertex planar graphs of pathwidth 3 with anagram-free chromatic number .. We also describe . vertex graphs with pathwidth . having anagram-free chromati

發(fā)展

VICT

Calculus

牲畜欄

cogent