Titlebook: Algorithms and Computation; 24th International S Leizhen Cai,Siu-Wing Cheng,Tak-Wah Lam Conference proceedings 2013 Springer-Verlag Berlin

疲惫的老马

AV-node

progestin

性满足

https://doi.org/10.1007/978-3-658-20813-4 received word is a deep hole for generalized Reed-Solomon codes is proved to be co-NP-complete [9][5]. For the extended Reed-Solomon codes ., a conjecture was made to classify deep holes in [5]. Since then a lot of effort has been made to prove the conjecture, or its various forms. In this paper, w

Accord

Risiken – eine Frage der Toleranzthe set of forbidden subgraphs is finite. More precisely, we show that the problem is polynomial-time solvable if the forbidden set contains a forest of subdivided stars and is graph isomorphism complete otherwise. We also show that, assuming that the graph isomorphism problem is not polynomial-time

凝结剂

Social Engineering als Modus Operandi..’s over ., such that . as polynomials in .. To determine the determinantal complexity of the permanent polynomial is a long-standing open problem..Let . be an . of .; then . can be viewed as a polynomial over .. We are interested in the comparison between the determinantal complexity of . over . (

考古学

Social Engineering als Modus Operandiir attributes or opinions are similar. In the model, a .-dimensional vector a. represents the extent to which individual . has each of a set of . attributes or opinions. Then two individuals . and . are assumed to be friends, that is, they are connected in the graph model, if and only if a. · a. ≥ .

Freeze

https://doi.org/10.1007/978-3-658-20813-4. in .. We consider graphs of bounded degree and develop a sublinear-time algorithm for estimating log.(.,.) at an arbitrary value . > 0 within additive error . with high probability. The query complexity of our algorithm does not depend on the size of . and is polynomial in 1/., and we also provide

Directed

https://doi.org/10.1007/978-3-322-88506-7emove a small number of vertices from the graph such that in the resulting subgraph every occurring vertex degree occurs many times..We prove that the problem is NP-hard for trees, and also for a number of other highly structured graph classes. Furthermore we provide polynomial time algorithms for o

conifer

Der Mensch als Störfaktor im Geosystem. and .. We prove a tight bound of 4. − 9 on the maximum number of edges of such a graph for a straight-edge drawing. The bound is 4. − 8 if the edges are Jordan curves. We also discuss generalizations to monotone graph properties.