Results 51 to 60 of about 6,219 (246)
Oriented Flip Graphs and Noncrossing Tree Partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Given a tree embedded in a disk, we define two lattices - the oriented flip graph of noncrossing arcs and the lattice of noncrossing tree partitions.
Alexander Garver, Thomas McConville
doaj +1 more source
Abstract Euler Diagram Isomorphism [PDF]
, 2008 Euler diagrams are widely used for information visualization and form the basis of a variety of formal languages that are used to express constraints in computing.
Andrew Fish +6 more
core
Symmetry Reduced Model Checking for B [PDF]
, 2007 Symmetry reduction is a technique that can help alleviate the problem of state space explosion in model checking. The idea is to verify only a subset of states from each class (orbit) of symmetric states.
Edd Turner +7 more
core +1 more source
An Efficient Algorithm for Graph Isomorphism [PDF]
Journal of the ACM, 1970 A procedure for determining whether two graphs are isomorphic is described. During the procedure, from any given graph two graphs, the representative graph and the reordered graph, are derived. The representative graph is a homomorphic image of the original graph; the reordered graph is constructed from the representative graph to be isomorphic to the ...
Derek G. Corneil, C. C. Gotlieb
openaire +1 more source
Exploiting Ferroelectric and Spintronic Dynamics for Neural Network Computation
Advanced Intelligent Systems, EarlyView.Ferroelectric and spintronic devices, relying on the control of polarization and magnetization, offer intrinsically fast, durable, energy‐efficient, and low‐latency building blocks for analog in‐memory computing. The hysteretic dynamics of an order parameter are leveraged to provide nonvolatile, multistate memory and nonlinear switching. Brain‐inspired
Dashiell Harrison +4 more
wiley +1 more source
Transactions on Networks and Communications, 2017 To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs are isomorphic, in each of them we can find such positionally equivalent auxiliary digraphs that have the same ...
openaire +3 more sources
On Isomorphisms of Vertex-transitive Graphs [PDF]
The Electronic Journal of Combinatorics, 2016 The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel results. Some interesting vertex-transitive graphs are given, including a first example of connected symmetric non ...
Jing Chen, Binzhou Xia
openaire +3 more sources
Business Strategy and the Environment, EarlyView.ABSTRACT As firms increasingly incorporate environmental, social, and governance (ESG) concerns into their strategic agendas, stakeholder legitimacy—an audience‐conferred judgment of organizational appropriateness—has become pivotal. We theorize legitimacy as expanding a hybrid response portfolio in which firms may pursue substantive change (business ...
Min‐Jae Lee +3 more
wiley +1 more source
A SURVEY INTUITIONISTIC FUZZY GRAPH [PDF]
Fiabilitate şi Durabilitate, 2018 I will begin with the presentation of the basic definitions required for the development of this survey- graph. Rosenfeld [5] first introduced the concept of fuzzy graphs. After that fuzzy graph theory becomes a vast research area. The first definition
Iuliana Carmen BĂRBĂCIORU +1 more
doaj
Advances in Mechanical Engineering, 2022 Isomorphism identification is an essential step in the structure synthesis of Kinematic Chain (KC), and needs a large amount of analysis and calculation.
Liangbo Sun +5 more
doaj +1 more source