Searching for authors named "Luitpold Babel" – sorted by Relevance.
-
Traversing and Optimizing Tree-like P4-connected Graphs
- Traversing and Optimizing Tree-like P 4 -connected Graphs Luitpold Babel y Institut fur
- Add To MetaCart
-
On the Structure of P 4 -connected Graphs and the Separable-Homogeneous Decomposition
- On the Structure of P 4 -connected Graphs and the Separable-Homogeneous Decomposition Luitpold
- Add To MetaCart
-
On the Structure of Graphs with Few P 4 s
- On the Structure of Graphs with Few P 4 s Luitpold Babel y Stephan Olariu z March 8, 1997
- Add To MetaCart
-
Computing Coherent Configurations
- T U M Fakult at f ur Mathematik Computing Coherent Congurations Luitpold Babel ABCDE FGHIJ KLMNO
- Add To MetaCart
-
A new characterization of P 4 -connected graphs
- A new characterization of P 4 - connected graphs Luitpold Babel Stephan Olariu y March 8, 1997
- Cited by 2 (1 self) – Add To MetaCart
-
STABCOL: An Efficient Implementation of the Weisfeiler-Leman Algorithm
- STABCOL: An Efficient Implementation of the Weisfeiler-Leman Algorithm Luitpold Babel Stefan
- Add To MetaCart
-
STABCOL: Graph Isomorphism Testing Based on the Weisfeiler-Leman Algorithm
- STABCOL: Graph Isomorphism Testing Based on the Weisfeiler-Leman Algorithm Luitpold Babel Stefan
- Cited by 8 (3 self) – Add To MetaCart
-
Recognizing the P4-structure of claw-free graphs and of a larger class of graphs
- –structure of claw–free graphs and a larger graph class Luitpold Babel 1† and Andreas Brandstädt 2‡ and Van
- Cited by 1 (1 self) – Add To MetaCart
-
Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. II. Program Implementation of the Weisfeiler-Leman Algorithm
- Preliminary Version Luitpold Babel 1 Institut fur Mathematik Technische Universitat Munchen D--80290 Munchen
- Cited by 8 (2 self) – Add To MetaCart

