Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: trees
Found
32 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Tree-core and tree-coritivity of graphs
2015,
Xu Jin
A new graph parameter, called tree-coritivity, is introduced in this paper. A...
Efficient representative pattern mining based on weight and maximality conditions
2016,
Yun Unil
As a core area in data mining, frequent pattern (or itemset) mining has been studied...
Chain rotations: A new look at tree distance
2013,
Luccio Fabrizio
As well known the rotation distance D ( S , T ) between two binary trees S , T of n...
Subquadrature expansions for TSRK methods
2012,
Kvrn Anne
The representation of order conditions for general linear methods formulated using an...
A Cubic‐Vertex Kernel for Flip Consensus Tree
2014,
Uhlmann Johannes
Given a bipartite graph G =( V c , V t , E ) and a nonnegative integer k , the...
Contracting Graphs to Paths and Trees
2014,
Lokshtanov Daniel
Vertex deletion and edge deletion problems play a central role in parameterized...
On the generalized multiway cut in trees problem
2014,
Zhang Peng
Given a tree T = ( V , E ) with n vertices and a collection of terminal sets D = { S 1...
Algorithmic and structural aspects of the P 3‐Radon number
2013,
Dourado Mitre
The generalization of classical results about convex sets in ℝ n to abstract...
Walks in phylogenetic treespace
2011,
Caceres Alan Joseph J
We prove that the spaces of unrooted phylogenetic trees are Hamiltonian for two...
Minimum Cost Partitions of Trees with Supply and Demand
2012,
Nishizeki Takao
Let T be a given tree. Each vertex of T is either a supply vertex or a demand vertex,...
Fuzzy fault tree approach for analysing the fuzzy reliability of a gas power plant
2012,
Kumar Amit
In conventional reliability analysis, the failure probabilities of the components of a...
Exploiting Tree Decomposition for Guiding Neighborhoods Exploration for VNS
2013,
Boizumault Patrice
Tree decomposition introduced by Robertson and Seymour aims to decompose a problem...
Comparing classification tree structures:a special case of comparing q‐ary relations
1999,
Lerman Israel-Cesar
Comparing q‐ary relations on a set 𝒪 of elementary objects is one of the...
Comparing classification tree structures: A special case of comparing q‐ary relations II
2000,
Lerman I C
Comparing q ‐ary relations on a set 𝒪 of elementary objects is one of the...
Structural Search and Optimization in Social Networks
2012,
Sriskandarajah Chelliah
The explosive growth in the variety and size of social networks has focused attention...
A branch‐and‐cut algorithm for the Steiner tree problem with delays
2012,
Haouari M
In this paper, we investigate the Steiner tree problem with delays, which is a...
Linear Bidirectional On‐Line Construction of Affix Trees
2003,
Maa
Affix trees are a generalization of suffix trees that are based on the inherent...
An Edit Distance between Quotiented Trees
2003,
Ferraro
In this paper we propose a dynamic programming algorithm to compare two quotiented...
A Self‐stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives
2012,
Chepoi Victor
Given a graph G =( V , E ), a vertex v of G is a median vertex if it minimizes the sum...
Drawing (Complete) Binary Tanglegrams
2012,
Okamoto Yoshio
A binary tanglegram is a drawing of a pair of rooted binary trees whose leaf sets are...
An Experimental Study of Compression Methods for Dynamic Tries
2002,
Nilsson S
We study an order‐preserving general purpose data structure for binary data,...
Efficient Bulk Operations on Dynamic R‐Trees
2002,
Arge L
In recent years there has been an upsurge of interest in spatial databases. A major...
Fast Parallel Reordering and Isomorphism Testing of k ‐Trees
2002,
Del Greco
In this paper two problems on the class of k ‐trees, a subclass of the class of...
Algorithms for Coloring Quadtrees
2002,
Eppstein
We describe simple linear time algorithms for coloring the squares of balanced and...
1
2
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers