Výsledky vyhľadávania - "[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]"

A Partitioning Technique for a Waveform Relaxation Method Using Eigenvectors in the Transient Stability Analysis of Power Systems Autor Tsuji, T., Magoules, F., Uchida, K., Oyama, T.

Získať plný text

Packing of arborescences with matroid constraints via matroid intersection Autor Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa

Získať plný text

Modeling and hexahedral meshing of cerebral arterial networks from centerlines Autor Méghane Decroocq, Carole Frindel, Pierre Rougé, Makoto Ohta, Guillaume Lavoué

Získať plný text

On the expressivity of time-varying graphs Autor Casteigts, Arnaud, Flocchini, Paola, Godard, Emmanuel, Santoro, Nicola, Yamashita, Masafumi

“…In highly dynamic systems (such as wireless mobile ad hoc networks, robotic swarms, vehicular networks, etc.) connectivity does not necessarily hold at a given…”
Získať plný text

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs Autor Bazin, Alexandre, Beaudou, Laurent, Kahn, Giacomo, Khoshkhah, Kaveh

“…We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are…”
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

On the expressivity of time-varying graphs Autor Casteigts, Arnaud, Flocchini, Paola, Godard, Emmanuel, Santoro, Nicola, Yamashita, Masafumi

Získať plný text

Cops and Robbers on Dynamic Graphs: Offline and Online Case Autor Balev, Stefan, Jiménez Laredo, Juan, Lamprou, Ioannis, Pigné, Yoann, Sanlaville, Eric

“…We examine the classic game of Cops and Robbers played on models of dynamic graphs, that is, graphs evolving over discrete time steps. At each time step, a…”
Získať plný text

Cayley graphs of basic algebraic structures Autor Caucal, Didier

“…We present simple graph-theoretic characterizations for the Cayley graphs of monoids, right-cancellative monoids, left-cancellative monoids, and groups…”
Získať plný text

Locating sets of vertices on Hamiltonian cycles Autor Li, Hao, Faudree, Ralph, Yoshimoto, Kiyoshi

Získať plný text

An efficient certificateless aggregate signature scheme for vehicular ad-hoc networks Autor Malhi, Avleen Kaur, Batra, Shalini

“…Distributed Computing and Networking The state-of-the-art telecommunication technologies have widely been adapted for sensing the traffic related information…”
Získať plný text

Walks in the Quarter Plane with Multiple Steps Autor Kauers, Manuel, Yatchak, Rika

“…We extend the classification of nearest neighbour walks in the quarter plane to models in which multiplicities are attached to each direction in the step set…”
Získať plný text

(k − 2)-linear connected components in hypergraphs of rank k Autor Galliot, Florian, Gravier, Sylvain, Sivignon, Isabelle

“…We define a q-linear path in a hypergraph H as a sequence (e_1,...,e_L) of edges of H such that |e_i ∩ e_i+1 | ∈ [[1, q]] and e_i ∩ e_j = ∅ if |i − j| > 1. In…”
Získať plný text

Single‐conflict colouring Autor Zdeněk Dvořák, Louis Esperet, Ross J. Kang, Kenta Ozeki

Získať plný text

Large-scale parallelism for constraint-based local search: the costas array case study Autor Caniou, Yves, Codognet, Philippe, Richoux, Florian, Diaz, Daniel, Abreu, Salvador

“…We present the parallel implementation of a constraint-based Local Search algorithm and investigate its performance on several hardware platforms with several…”
Získať plný text

On packing spanning arborescences with matroid constraint Autor Quentin Fortier, Shin-ichi Tanigawa, Csaba Király, Zoltán Szigeti

Získať plný text

Freezing, Bounded-Change and Convergent Cellular Automata Autor Ollinger, Nicolas, Theyssier, Guillaume

“…This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only…”
Získať plný text

Improving Vertex Cover as a Graph Parameter Autor Ganian, Robert

“…Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for…”
Získať plný text

Gossiping with interference in radio ring networks Autor Bermond, Jean-Claude, Kodate, Takako, Yu, Joseph

Získať plný text

On a combination of the 1-2-3 Conjecture and the Antimagic Labelling Conjecture Autor Bensmail, Julien, Senhaji, Mohammed, Szabo Lyngsie, Kasper

“…This paper is dedicated to studying the following question: Is it always possible to injectively assign the weights 1, ..., |E(G)| to the edges of any given…”
Získať plný text