31 search results - page 2 / 7 » Combinatorial Network Abstraction by Trees and Distances |
DAM
2006
13 years 5 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
Abstract—Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization...
MFCS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...
PPSN
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
TJS
2010
13 years 3 months ago
2010
This paper presents a novel host-based combinatorial method based on k-Means clustering and ID3 decision tree learning algorithms for unsupervised classification of anomalous and ...