Search Results - "Yeo, Anders"

Dominating Vertex Covers: The Vertex-Edge Domination Problem by Klostermeyer, William F., Messinger, Margaret-Ellen, Yeo, Anders

“…The of a graph, ), is defined to be the cardinality of a smallest set such that there exists a vertex cover of such that each vertex in is dominated by a…”
Get full text

Bounds on upper transversals in hypergraphs by Henning, Michael A., Yeo, Anders

Get full text

On the Meyniel condition for hamiltonicity in bipartite digraphs by Adamus, Janusz, Adamus, Lech, Yeo, Anders

“…Graph Theory We prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digraph: For a≥2, a strongly connected balanced bipartite…”
Get full text

Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem by Cohen, Nathann, Fomin, Fedor V., Gutin, Gregory, Kim, Eun Jung, Saurabh, Saket, Yeo, Anders

“…An out-tree T is an oriented tree with only one vertex of in-degree zero. A vertex x of T is internal if its out-degree is positive. We design randomized and…”
Get full text

A dichotomy for minimum cost graph homomorphisms by Gutin, Gregory, Hell, Pavol, Rafiey, Arash, Yeo, Anders

“…For graphs G and H , a mapping f : V ( G ) → V ( H ) is a homomorphism of G to H if u v ∈ E ( G ) implies f ( u ) f ( v ) ∈ E ( H ) . If, moreover, each vertex…”
Get full text

The Linear Arrangement Problem Parameterized Above Guaranteed Value by Gutin, Gregory, Rafiey, Arash, Szeider, Stefan, Yeo, Anders

“…A linear arrangement (LA) is an assignment of distinct integers to the vertices of a graph. The cost of an LA is the sum of lengths of the edges of the graph,…”
Get full text

(1,1)-Cluster Editing is polynomial-time solvable by Gutin, Gregory, Yeo, Anders

“…A graph H is a clique graph if H is a vertex-disjoin union of cliques. Abu-Khzam (2017) introduced the (a,d)-Cluster Editing problem, where for fixed natural…”
Get full text

Transversal coalitions in hypergraphs by Henning, Michael A., Yeo, Anders

“…A transversal in a hypergraph H is set of vertices that intersect every edge of H. A transversal coalition in H consists of two disjoint sets of vertices X and…”
Get full text

Directed Steiner tree packing and directed tree connectivity by Sun, Yuefang, Yeo, Anders

“…For a digraph D =(V( D ) , A( D ) ) $D=(V(D),A(D))$, and a set S ⊆ V( D ) $S\subseteq V(D)$ with r ∈ S $r\in S$ and ∣ S ∣ ≥ 2 $| S| \ge 2$, an (S , r )…”
Get full text

Perfect forests in graphs and their extensions by Gutin, Gregory, Yeo, Anders

“…Let G $G$ be a graph on n $n$ vertices. For i∈{0,1} $i\in \{0,1\}$, a spanning forest F $F$ of G $G$ is called an i $i$‐perfect forest if every tree in F $F$…”
Get full text

A maximum degree theorem for diameter-2-critical graphs by Haynes Teresa, Henning Michael, Merwe Lucas, Yeo Anders

Get full text

Matching and edge-connectivity in graphs with given maximum degree by Henning, Michael A., Yeo, Anders

“…In a recent paper (2018) [10] the authors determine tight lower bounds on the matching number in a graph with given maximum degree in terms of the number of…”
Get full text

Finding all stable matchings with assignment constraints by Gutin, Gregory Z., Neary, Philip R., Yeo, Anders

“…In this paper we consider stable matchings subject to assignment constraints. These are matchings that require certain assigned pairs to be included, insist…”
Get full text

Note on disjoint cycles in multipartite tournaments by Gutin, Gregory, Li, Wei, Wang, Shujing, Yeo, Anders, Zhou, Yacong

“…In 1981, Bermond and Thomassen conjectured that for any positive integer k, every digraph with minimum out-degree at least 2k−1 admits k vertex-disjoint…”
Get full text

Spanning eulerian subdigraphs in semicomplete digraphs by Bang-Jensen, Jørgen, Havet, Frédéric, Yeo, Anders

“…A digraph is eulerian if it is connected and every vertex has its in-degree equal to its outdegree. Having a spanning eulerian subdigraph is thus a weakening…”
Get full text

Exact capacitated domination: On the computational complexity of uniqueness by Gutin, Gregory Z., Neary, Philip R., Yeo, Anders

“…Gerke et al. (2019) introduced a game-theoretic model to study public good provision in social networks when there are constraints on sharing. This model…”
Get full text

Graphical coprime walk algorithm for structural controllability of discrete-time rank-one bilinear systems by Ghosh, Supratim, Ruths, Justin, Yeo, Anders

“…In prior work, we established exact graphical conditions for the structural controllability of discrete-time rank-one bilinear systems. Controllability of…”
Get full text

Results on the small quasi-kernel conjecture by Ai, Jiangdong, Gerke, Stefanie, Gutin, Gregory, Yeo, Anders, Zhou, Yacong

“…A quasi-kernel of a digraph D is an independent set Q⊆V(D) such that for every vertex v∈V(D)﹨Q, there exists a directed path with one or two arcs from v to a…”
Get full text

Kernel bounds for disjoint cycles and disjoint paths by Bodlaender, Hans L., Thomassé, Stéphan, Yeo, Anders

“…In this paper, we show that the problems Disjoint Cycles and Disjoint Paths do not have polynomial kernels, unless N P ⊆ c o N P / p o l y . Thus, these…”
Get full text

Note on Perfect Forests in Digraphs by Gutin, Gregory, Yeo, Anders

“…A spanning subgraph F of a graph G is called perfect if F is a forest, the degree dF(x) of each vertex x in F is odd, and each tree of F is an induced subgraph…”
Get full text