Searching for "Switching Graphs." – sorted by Relevance.
-
Switching Graphs
- Switching Graphs Jan Friso Groote J.F.Groote@(email omitted); Bas Ploeger ∗ S.C.W.Ploeger@(email omitted); Department
- Add To MetaCart
-
Edge--Disjoint Routing in Plane Switch Graphs in
- Edge–Disjoint Routing in Plane Switch Graphs in Linear Time JAN M. HOCHSTEIN 1 and KARSTEN WEIHE 2
- Cited by 1 (0 self) – Add To MetaCart
-
Graphs, Matrix Inequalities, and Switching for the Formation Flying Control of Multiple Spacecraft
- Graphs, Matrix Inequalities, and Switching for the Formation Flying Control of Multiple Spacecraft
- Cited by 2 (0 self) – Add To MetaCart
-
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes
- Euler graphs, triangle-free graphs and bipartite graphs in switching classes Jurriaan Hage 1
- Cited by 1 (1 self) – Add To MetaCart
-
The complexity of the bigamist matching problem
- reachability” algorithm to find a simple path in an undirected switch graph, which is equivalent to finding
- Add To MetaCart
-
A local switch Markov chain on given degree graphs with application in connectivity of peer
- A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer
- Cited by 4 (0 self) – Add To MetaCart
-
Automorphisms and Enumeration of Switching Classes of Tournaments
- switching class. 1 Introduction The concept of switching of graphs (sometimes referred to as Seidel
- Cited by 3 (1 self) – Add To MetaCart
-
Complexity of Hypergraph Coloring and
- Praha 1 Czech Republic honza@(email omitted); Abstract. Seidel's switching of a vertex in a given graph
- Add To MetaCart
-
Switching With More Than Two Colours
- Seidel Abstract The operation of switching a finite graph was introduced by Seidel, in the study
- Add To MetaCart
-
Mode Switching Synthesis for Reachability Specifications
- , the construction presented in this section will abstract the mode switching logic into a purely discrete graph
- Cited by 11 (5 self) – Add To MetaCart

