Titlebook: Computer Science – Theory and Applications; 15th International C Henning Fernau Conference proceedings 2020 Springer Nature Switzerland AG

借喻

Central Positions in Social Networks,as the whole of its relationships to the rest of the network, we obtain a very general procedure for doing centrality analysis; not only on social networks but networks from all kinds of domains. Our framework further suggests a variety of computational challenges.

为敌

Faster 2-Disjoint-Shortest-Paths Algorithm,irected graphs and arbitrary positive edge weights (lengths). In this paper, we examine the DP relations arising in this problem and reduce the time complexity to . for the unit-length case and to . for the case of general weights.

GLOSS

growth-factor

Second-Order Finite Automata,that several width and size minimization problems for deterministic and nondeterministic ODDs are solvable in fixed-parameter tractable time when parameterized by the width of the input ODD. In particular, our results imply FPT algorithms for corresponding width and size minimization problems for or

Paleontology

亲密

On Embeddability of Unit Disk Graphs onto Straight Lines,ess sensor networks. We consider the unit disk graph realization problem on a restricted domain, by assuming a scenario where the wireless sensor nodes are deployed on the corridors of a building. Based on this scenario, we impose a geometric constraint such that the unit disks must be centered onto

高兴一回

On the Decision Tree Complexity of Threshold Functions,d OR queries of arbitrary fan-in the complexity of the majority function is ...In the second part of the paper we address parity decision trees that are allowed to query arbitrary parities of input bits. There are various lower bound techniques for parity decision trees complexity including analytic

Contend

Parameterized Complexity of Fair Feedback Vertex Set Problem,blem is trivially NP-complete; we show that . problem when parameterized by the solution size . and the maximum degree . of the graph ., admits a kernel of size .. Finally, we study . problem, where we want that the size of . is at most . and for every vertex outside ., that is, for all ., . has at

BOOM

车床