Sciweavers

192 search results - page 30 / 39
» On Graph Isomorphism for Restricted Graph Classes
Sort
View
94
Voted
TMRA
2005
Springer
15 years 5 months ago
Collaborative Software Development and Topic Maps
This work-in-progress report subsumes our ongoing research to develop a Topic Maps centric, modularised system which supports collaborative software development by combining the me...
Markus Ueberall, Oswald Drobnik
ENTCS
2002
90views more  ENTCS 2002»
14 years 11 months ago
Specifying Graph-like Diagrams with DIAGEN
ended abstract demonstrates that creating editors and environments for visual languages becomes considerably easier when restricting the class of visual languages. The presented a...
Mark Minas
101
Voted
DAM
2002
82views more  DAM 2002»
14 years 11 months ago
On the computational complexity of strong edge coloring
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Mohammad Mahdian
WEA
2005
Springer
91views Algorithms» more  WEA 2005»
15 years 5 months ago
The Necessity of Timekeeping in Adversarial Queueing
We study queueing strategies in the adversarial queueing model. Rather than discussing individual prominent queueing strategies we tackle the issue on a general level and analyze c...
Maik Weinard
TASE
2007
IEEE
15 years 6 months ago
Symmetry Reduced Model Checking for B
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 (or...
Edd Turner, Michael Leuschel, Corinna Spermann, Mi...