Sciweavers

620 search results - page 64 / 124
» The edge-flipping group of a graph
Sort
View
TMRA
2005
Springer
14 years 2 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
CIKM
2008
Springer
13 years 11 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
COMBINATORICA
2007
126views more  COMBINATORICA 2007»
13 years 9 months ago
Privileged users in zero-error transmission over a noisy channel
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
Noga Alon, Eyal Lubetzky
ALMOB
2006
89views more  ALMOB 2006»
13 years 9 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
EM
2010
155views Management» more  EM 2010»
13 years 9 months ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...