Corpus ID: 59713279

Structural Aspects Of Switching Classes

@inproceedings{Hage2001StructuralAO,
  title={Structural Aspects Of Switching Classes},
  author={J. Hage},
  year={2001}
}
  • J. Hage
  • Published 2001
  • Computer Science
Proefschrift ter verkrijging van de graad van Doctor aan de Universiteit Leiden, op gezag van de Rector Magnificus Dr. Jurriaan Hage geboren te Alphen aan den Rijn in 1969 The work in this thesis was carried within the context of the IPA graduate school. 
Data Mining using Genetic Programming : Classification and Symbolic Regression
proefschrift ter verkrijging van de graad van Doctor aan de Universiteit Leiden, op gezag van de Rector Magnificus Dr. Promotiecommissie Promotor: The work in this thesis has been carried out underExpand
Citius, Vilius, Melius : guiding and cost-optimality in model checking of timed and hybrid systems
TLDR
Als de twee kranen die men voor elk transport moet gebruiken hetzelfde spoor moeten delen, kan de andere de weg versperren, charges kunnen elkaar hinderen. Expand
Towards a characterization of bipartite switching classes by means of forbidden subgraphs
  • J. Hage, T. Harju
  • Mathematics, Computer Science
  • Discuss. Math. Graph Theory
  • 2007
TLDR
The aim is a characterization by means of a set of critically non-bipartite graphs: they do not have a bipartite switch, but every induced proper subgraph does. Expand
graphs with maximum size in their switching classes
In his PhD thesis [Structural aspects of switching classes, Leiden Institute of Advanced Computer Science, 2001] Hage posed the following problem: “characterize the maximum size graphs in switchingExpand
On graphs with maximum size in their switching classes
In his PhD thesis [Structural aspects of switching classes, Leiden Institute of Advanced Computer Science, 2001] Hage posed the following problem: “characterize the maximum size graphs in switchingExpand
Coalgebraic analysis of probabilistic systems
Dit proefschrift verzamelt verscheidene theoretische resultaten, waardoor twee onderzoeksgebieden in de theoretische informatica verbonden worden: de theorie van coalgebra's en het probabilistischExpand
Enhancing state space reduction techniques for model checking
Model-checking is een techniek voor het automatisch opsporen van fouten in en de verificatie van hardware en software. De techniek is gebaseerd op het doorzoeken van de globale toestandsruimte vanExpand
Real-time scheduling for media processing using conditionally guaranteed budgets
In dit proefschrift behandelen we een planningsprobleem dat haar oorsprong vindt in het kosteneffectief verwerken van verschillende media door software in consumentenapparaten, zoals digitaleExpand
Parameterized Problems Related to Seidel's Switching
TLDR
The study of computational complexity aspects of Seidel's switching is continued, concentrating on Fixed Parameter Complexity and the NP-completeness of Maximum Likelihood Decoding of graph theoretic codes based on complete graphs. Expand
The Embedding Problem For Switching Classes
In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labelled) graphs through localExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 108 REFERENCES
Pancyclicity in switching classes
TLDR
It is shown that every switching class, except the class of all complete bipartite graphs, contains a pancyclic graph, which implies that deciding whether a switching class contains a hamiltonian graph can be done in polynomial time although this problem is NP-complete for graphs. Expand
Acyclicity of Switching Classes
TLDR
It is proved that the trees of a switching class G are isomorphic to each other and the types of treesT that have isomorphic copies in G are determined. Expand
Algorithms for graphs of small treewidth
Veel problemen uit de praktijk kunnen worden gemodelleerd als optimaliserings- of beslis-singsproblemen op grafen. Denk bijvoorbeeld aan het probleem waarbij een koerier een aantal pakketjes moetExpand
Scheduling with communication for multiprocessor computation
Multiprocessor scheduling houdt zich bezig met de planning van de uitvoering van computer-programma s op een parallelle computer. Een computerprogramma kan worden gezien als een collectieExpand
On the Computational Complexity of Seidel's Switching
Given a graph G and a vertex of G , Seidel's switching of v in G results in making v adjacent to exactly those vertices it was nonadjacent to in G , while the rest of G remains unchanged. Graphs GExpand
Complexity Issues in Switching of Graphs
TLDR
Within this framework, a modification of Yannakakis’ result is proved and used to show NP-completeness for the embedding problem, and the 3-colourability problem is proved. Expand
On Perfect Switching Classes
  • A. Hertz
  • Computer Science
  • Discret. Appl. Math.
  • 1999
TLDR
It is shown that a switching class is perfect if and only if some graph in the class is &-f&e, and that whether a graph belongs to such a class can be determined in polynomial time. Expand
Graph Theory with Applications
TLDR
The burgeoning of Graph Theory was first aware when I studied the 1940 paper of Brooks, Smith, Stone and Tutte in the Duke Mathematical Journal, ostensibly on squared rectangles, all in the Quest of the Perfect Square. Expand
The size of switching classes with skew gains
TLDR
This paper compute the sizes of the resulting equivalence classes of skew gain graphs and shows how to reduce the general problem to connected graphs and prove that if the graph is connected, but not bipartite, it can be reduced to the complete case. Expand
TWO-GRAPHS, SWITCHING CLASSES AND EULER GRAPHS ARE EQUAL IN NUMBER*
Seidel has shown that the number $t_n $ of two-graphs on n nodes is equal to the number of switching classes of graphs on n nodes. Robinson, and independently Liskovec, have given an explicit formulaExpand
...
1
2
3
4
5
...