Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Lauri, Juho"'
An exact $(k,d)$-coloring of a graph $G$ is a coloring of its vertices with $k$ colors such that each vertex $v$ is adjacent to exactly $d$ vertices having the same color as $v$. The exact $d$-defective chromatic number, denoted $\chi_d^=(G)$, is the
Externí odkaz:
http://arxiv.org/abs/2109.05255
We study a family of reachability problems under waiting-time restrictions in temporal and vertex-colored temporal graphs. Given a temporal graph and a set of source vertices, we find the set of vertices that are reachable from a source via a time-re
Externí odkaz:
http://arxiv.org/abs/2010.08423
A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph is rainbow-connected if there is a rainbow path between each pair of its vertices. The minimum number of colors needed to rainbow-connect a graph $G$
Externí odkaz:
http://arxiv.org/abs/2006.06551
Autor:
Gurukar, Saket, Ajwani, Deepak, Dutta, Sourav, Lauri, Juho, Parthasarathy, Srinivasan, Sala, Alessandra
Increasingly, critical decisions in public policy, governance, and business strategy rely on a deeper understanding of the needs and opinions of constituent members (e.g. citizens, shareholders). While it has become easier to collect a large number o
Externí odkaz:
http://arxiv.org/abs/2001.09879
We study a family of pattern-detection problems in vertex-colored temporal graphs. In particular, given a vertex-colored temporal graph and a multiset of colors as a query, we search for temporal paths in the graph that contain the colors specified i
Externí odkaz:
http://arxiv.org/abs/2001.07158
Combinatorial optimization problems arise in a wide range of applications from diverse domains. Many of these problems are NP-hard and designing efficient heuristics for them requires considerable time and experimentation. On the other hand, the numb
Externí odkaz:
http://arxiv.org/abs/2001.01230
We propose a multi-stage learning approach for pruning the search space of maximum clique enumeration, a fundamental computationally difficult problem arising in various network analysis tasks. In each stage, our approach learns the characteristics o
Externí odkaz:
http://arxiv.org/abs/1910.00517
Autor:
Lauri, Juho, Mitillos, Christodoulos
A perfect Italian dominating function of a graph $G=(V,E)$ is a function $f : V \to \{0,1,2\}$ such that for every vertex $f(v) = 0$, it holds that $\sum_{u \in N(v)} f(u) = 2$, i.e., the weight of the labels assigned by $f$ to the neighbors of $v$ i
Externí odkaz:
http://arxiv.org/abs/1905.06293
Autor:
Lauri, Juho, Mitillos, Christodoulos
We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned into three independent dominating sets. In contrast, we show that this is
Externí odkaz:
http://arxiv.org/abs/1905.04695
Autor:
Lauri, Juho, Dutta, Sourav
We propose a simple, powerful, and flexible machine learning framework for (i) reducing the search space of computationally difficult enumeration variants of subset problems and (ii) augmenting existing state-of-the-art solvers with informative cues
Externí odkaz:
http://arxiv.org/abs/1902.08455