Výsledky vyhľadávania - Discrete Mathematics and Theoretical Computer Science

Introduction to local certification Autor Feuilloley, Laurent

“…A distributed graph algorithm is basically an algorithm where every node of a graph can look at its neighborhood at some distance in the graph and chose its…”
Získať plný text

Improved product structure for graphs on surfaces Autor Distel, Marc, Hickingbotham, Robert, Huynh, Tony, Wood, David R.

“…Dujmovi\'c, Joret, Micek, Morin, Ueckerdt and Wood [J. ACM 2020] proved that for every graph $G$ with Euler genus $g$ there is a graph $H$ with treewidth at…”
Získať plný text

Treewidth 2 in the Planar Graph Product Structure Theorem Autor Distel, Marc, Hendrey, Kevin, Karol, Nikolai, Wood, David R., Yip, Jung Hon

“…We prove that every planar graph is contained in $H_1\boxtimes H_2\boxtimes K_2$ for some graphs $H_1$ and $H_2$ both with treewidth 2. This resolves a…”
Získať plný text

Total $k$-coalition: bounds, exact values and an application to double coalition Autor Brešar, Boštjan, Klavžar, Sandi, Samadi, Babak

“…Let $G=\big{(}V(G),E(G)\big{)}$ be a graph with minimum degree $k$. A subset $S\subseteq V(G)$ is called a total $k$-dominating set if every vertex in $G$ has…”
Získať plný text

Permutation Entropy for Signal Analysis Autor Kay, Bill, Myers, Audun, Boydston, Thad, Ellwein, Emily, Mackenzie, Cameron, Alvarez, Iliana, Lentz, Erik

“…Shannon Entropy is the preeminent tool for measuring the level of uncertainty (and conversely, information content) in a random variable. In the field of…”
Získať plný text

Hypergraph Representation via Axis-Aligned Point-Subspace Cover Autor Firman, Oksana, Spoerhase, Joachim

“…A k-hypergraph is a k-partite k-uniform hypergraph, that is, a hypergraph with a partition of vertices into k parts such that each hyperedge contains exactly…”
Získať plný text

4-tangrams are 4-avoidable Autor Ochem, Pascal, Pierron, Théo

“…A tangram is a word in which every letter occurs an even number of times. Thus it can be cut into parts that can be arranged into two identical words. The…”
Získať plný text

Watson-Crick conjugates of words and languages Autor Mahalingam, Kalpana, Maity, Anuran

“…In this work, we explore the concept of Watson-Crick conjugates, also known as $θ$-conjugates (where $θ$ is an antimorphic involution), of words and languages…”
Získať plný text

The Price of Upwardness Autor Angelini, Patrizio, Biedl, Therese, Chimani, Markus, Cornelsen, Sabine, Da Lozzo, Giordano, Hong, Seok-Hee, Liotta, Giuseppe, Patrignani, Maurizio, Pupyrev, Sergey, Rutter, Ignaz, Wolff, Alexander

“…Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of…”
Získať plný text

Uniquely hamiltonian graphs for many sets of degrees Autor Brinkmann, Gunnar, De Pauw, Matthias

“…We give constructive proofs for the existence of uniquely hamiltonian graphs for various sets of degrees. We give constructions for all sets with minimum 2 (a…”
Získať plný text

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs Autor Di Battista, Giuseppe, Frati, Fabrizio

“…The algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line…”
Získať plný text

On the on-line coloring of unit interval graphs with proper interval representation Autor Curbelo, Israel R., Malko, Hannah R.

“…We define the problem as a two-player game between Algorithm and Builder. The game is played in rounds. Each round, Builder presents an interval that is…”
Získať plný text

Weakly toll convexity and proper interval graphs Autor Dourado, Mitre C., Gutierrez, Marisa, Protti, Fábio, Tondato, Silvia

“…A walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly toll walk} if $u_0u_i \in E(G)$ implies $u_i = u_1$ and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. A set $S$…”
Získať plný text

Flip-sort and combinatorial aspects of pop-stack sorting Autor Asinowski, Andrei, Banderier, Cyril, Hackl, Benjamin

“…Flip-sort is a natural sorting procedure which raises fascinating combinatorial questions. It finds its roots in the seminal work of Knuth on stack-based…”
Získať plný text

Joint distributions of statistics over permutations avoiding two patterns of length 3 Autor Han, Tian, Kitaev, Sergey

“…Finding distributions of permutation statistics over pattern-avoiding classes of permutations attracted much attention in the literature. In particular, Bukata…”
Získať plný text

The repetition threshold for binary rich words Autor Currie, James D., Mol, Lucas, Rampersad, Narad

“…A word of length $n$ is rich if it contains $n$ nonempty palindromic factors. An infinite word is rich if all of its finite factors are rich. Baranwal and…”
Získať plný text

A Note on Graph Burning of Path Forests Autor Tan, Ta Sheng, Teh, Wen Chean

“…Graph burning is a natural discrete graph algorithm inspired by the spread of social contagion. Despite its simplicity, some open problems remain steadfastly…”
Získať plný text

The total irregularity of a graph Autor Abdo, Hosam, Brandt, Stephan, Dimitrov, D.

“…Graph Theory In this note a new measure of irregularity of a graph G is introduced. It is named the total irregularity of a graph and is defined as irr(t)(G) -…”
Získať plný text

A positional statistic for 1324-avoiding permutations Autor Gil, Juan B., Lopez, Oscar A., Weiner, Michael D.

“…We consider the class $S_n(1324)$ of permutations of size $n$ that avoid the pattern 1324 and examine the subset $S_n^{a\prec n}(1324)$ of elements for which…”
Získať plný text

Colourings of $(m, n)$-coloured mixed graphs Autor MacGillivray, Gary, Nasserasr, Shahla, Yang, Feiran

“…A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m,…”
Získať plný text