Titlebook: Combinatorial Optimization and Applications; 13th International C Yingshu Li,Mihaela Cardei,Yan Huang Conference proceedings 2019 Springer

障礙

Celiac-Plexus

Balanced Connected Subgraph Problem in Geometric Intersection Graphs,iven a.graph ., where each vertex in . is colored with either “.” or “.”, the .?problem seeks a maximum cardinality induced connected subgraph . of . such that . is., i.e., . contains an equal number of red and blue vertices. We study the computational complexity landscape of the .?problem while con

Orgasm

游行

Contact Representations of Directed Planar Graphs in 2D and 3D,ntacts between those objects, which are examples of a drawing style called .. We study the feasibility of using line segments, triangles and tetrahedra to realize point-side contact representations for a number of graph classes including oriented versions of outerplanar graphs, 2-trees and 3-trees.

Omniscient

Identifying Structural Hole Spanners in Social Networks via Graph Embedding,ural hole spanners in social networks has received great attention in recent years. Existing SH spanners detection methods usually rely on graph theory knowledge. However, these methods have obvious drawbacks of poor performance and expensive computation for largescale networks. In this work, we pro

COW

pericardium

Lethargic

Approximation Algorithms for Maximally Balanced Connected Graph Partition,d, and the partition is maximally balanced in the way that the maximum cardinality of these . parts is minimized. We refer this problem to as . into . parts and denote it as . .. The general vertex-weighted version of this problem on trees has been studied since about four decades ago, which admits

BILK

Edge Exploration of a Graph by Mobile Agent, node of degree . are arbitrarily numbered .. A mobile agent, starting from some node, has to visit all the edges of the graph and stop. The time of the exploration is the number of edges the agent traverses before it stops. The task of exploration can not be performed even for a class of cycles if

Cumulus

,Fast Diameter Computation Within Split?Graphs,that although the diameter of a non-complete split graph can only be either 2 or 3, under the Strong Exponential-Time Hypothesis (SETH) we cannot compute the diameter of a split graph in less than quadratic time. Therefore it is worth to study the complexity of diameter computation on . of split gra