Results 11 to 20 of about 1,883 (72)
Discrete Mathematics & Theoretical Computer Science, 2014 Discrete ...
Milan Bradonjic +3 more
doaj +1 more source
Parameterized Problems Related to Seidel's Switching [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Graphs and ...
Eva Jelinkova +3 more
doaj +1 more source
An expected polynomial time algorithm for coloring 2-colorable 3-graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Graphs and ...
Yury Person, Mathias Schacht
doaj +1 more source
Deterministic Recurrent Communication and Synchronization in Restricted Sensor Network [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Distributed Computing and ...
Antonio Fernández Anta +2 more
doaj +1 more source
Structure of spanning trees on the two-dimensional Sierpinski gasket [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Combinatorics
Shu-Chiuan Chang, Lung-Chi Chen
doaj +1 more source
Graph classes and forbidden patterns on three vertices [PDF]
, 2020 This paper deals with graph classes characterization and recognition. A popular way to characterize a graph class is to list a minimal set of forbidden induced subgraphs.
Feuilloley, Laurent, Habib, Michel
core +1 more source
On the Book Thickness of k-Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Graphs and ...
Vida Dujmović, David R. Wood
doaj +1 more source
Properties of Carry Value Transformation [PDF]
, 2011 The notion of Carry Value Transformation (CVT) is a model of Discrete Deterministic Dynamical System. In this paper, we have studied some interesting properties of CVT and proved that (1) the addition of any two non-negative integers is same as the sum ...
Nayak, Birendra Kumar +2 more
core +3 more sources
Clustered Spanning Tree - Conditions for Feasibility [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Let H =< V, S > be a hypergraph, where V is a set of vertices and S is a set of not necessarily disjoint clusters Si ⊆ V. The Clustered Spanning Tree problem is to find a spanning tree of G which satisfies that each cluster induces a subtree, when it ...
Nili Guttmann-Beck +2 more
doaj +1 more source
Waiting time distributions for pattern occurrence in a constrained sequence [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Analysis of ...
Valeri T. Stefanov, Wojciech Szpankowski
doaj +1 more source