Results 21 to 30 of about 5,140 (295)
Anytime system level verification via parallel random exhaustive hardware in the loop simulation [PDF]
, 2016 System level verification of cyber-physical systems has the goal of verifying that the whole (i.e., software + hardware) system meets the given specifications.
MANCINI, Toni +4 more
core +1 more source
A Translational Approach to Constraint Answer Set Solving [PDF]
, 2010 We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic
Drescher, Christian, Walsh, Toby
core +2 more sources
Graceful And Graceful Labeling Of Graphs
, 2018 {"references": ["1.\tJ. A. Gallian, A Dynamic survey of graph labeling, The electronic journal of combinatory 16 (2009).DS6. 2.\tI. Gutman, The energy of a graph, Ber. Math-satist. sekt. Forschungsz. Graz 103 (1978), 1-22. 3.\tGutman and B. Zhou, Laplacian energy of a graph, linear algebra appl. 414 (2006), 29-37. 4.\tI.
M. Soundharya, R. Balakumar
openaire +2 more sources
Improper Graceful and Odd-graceful Labellings of Graph Theory
CoRR, 2015 In this paper we define some new labellings for trees, called the in-improper and out-improper odd-graceful labellings such that some trees labelled with the new labellings can induce graceful graphs having at least a cycle. We, next, apply the new labellings to construct large scale of graphs having improper graceful/odd-graceful labellings or having ...
Hongyu Wang 0006, Jin Xu 0002, Bing Yao
openaire +2 more sources
Characterizations of kites as graceful graphs
CuboWe introduce and study an infinite family of graceful graphs, which we call kites. The kites are graphs where a path is joined with a graph "forming" a kite.
Miroslav Haviar, Katarina Kotuľová
doaj +1 more source
An Adiabatic Quantum Algorithm for Determining Gracefulness of A Graph
, 2016 Graph labelling is one of the noticed contexts in combinatorics and graph theory. Graceful labelling for a graph $G$ with $e$ edges, is to label the vertices of $G$ with $0, 1, \cdots, e$ such that, if we specify to each edge the difference value between
Darareh, Mahdi Davoudi +3 more
core +1 more source
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
, 2020 A graceful labeling of a graph $G$ with $m$ edges consists of labeling the vertices of $G$ with distinct integers from $0$ to $m$ such that, when each edge is assigned as induced label the absolute difference of the labels of its endpoints, all induced ...
Dantas, Simone +2 more
core +2 more sources
Automatically generating streamlined constraint models with ESSENCE and CONJURE [PDF]
, 2015 Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution.
AM Frisch +11 more
core +1 more source