Titlebook: ;

GENRE

Perceive

雪崩

絆住

https://doi.org/10.1007/978-1-4684-4913-6wo 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;

VEST

https://doi.org/10.1007/978-981-16-4955-4We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We also show – as a new result – that computing hypertree decompositions is fixed-parameter intractable.

煩擾

Applications of Communications TheoryThe goal of this paper is to present a brief survey of a collection of methods and results from the area of combinatorial search [1,8] focusing on graph reconstruction using queries of different type. The study is motivated by applications to genome sequencing.

輪流

Modern Theories of Income DistributionWe settle two conjectures on domination-search, a game proposed by Fomin et.al. [1], one in affirmative and the other in negative. The two results presented here are (1) domination search number can be greater than domination-target number, (2) domination search number for asteroidal-triple-free graphs is at most 2.

灌溉

https://doi.org/10.1007/978-3-319-60143-4We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average degree is underlined, which contributes to generalise and improve previous known results about improper colourings of planar graphs.

Infiltrate

Simulate