Search results for "Rooted-Tree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
75	Md. Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman 0001	Upward Drawings of Trees on the Minimum Number of Layers.	WALCOM	2008	DBLP DOI BibTeX RDF	Planar Drawing, k-layer Planar Drawing, Upward Drawing, Minimum Layer Upward Drawing, Algorithm, Trees, Line-labeling, Straight-line Drawing
65	Kazunori Yamagata, Tomoyuki Uchida, Takayoshi Shoudai, Yasuaki Nakamura	An Effective Grammar-Based Compression Algorithm for Tree Structured Data.	ILP	2003	DBLP DOI BibTeX RDF
54	Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li 0001, Weizhao Wang	A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees.	ISAAC	2006	DBLP DOI BibTeX RDF
52	Michael Mitzenmacher	Constant Time per Edge is Optimal on Rooted Tree Networks.	Distributed Comput.	1997	DBLP DOI BibTeX RDF	Increasing convex ordering, Queueing theory, Tree networks, Stochastic comparisons
51	Mohamed Naimi	Parallel assignment to distinct identities in arbitrary networks.	ICCCN	1995	DBLP DOI BibTeX RDF	sequential distributed algorithm, parallel assignment, distinct identities, parallel distributed algorithm, distributed system nodes, initiator channel, children channel, outgoing channels, upper bound time transmission, parallel algorithms, multiprocessor interconnection networks, time complexity, communication complexity, spanning tree, depth-first search, network diameter, rooted tree, arbitrary network, synchronous distributed systems
50	Yusuke Suzuki, Ryuta Akanuma, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida	Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data.	COLT	2002	DBLP DOI BibTeX RDF
50	Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos	Isomorphism for Graphs of Bounded Distance Width.	Algorithmica	1999	DBLP DOI BibTeX RDF	Distance pathwidth, Distance treewidth, Graph isomorphism, Fixed parameter tractability
50	Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos	Isomorphism for Graphs of Bounded Distance Width.	CIAC	1997	DBLP DOI BibTeX RDF
48	Zhicheng Dai, Zhi Li 0027, Bingwen Wang, Qiang Tang 0004	RTKPS: A Key Pre-distribution Scheme Based on Rooted-Tree in Wireless Sensor and Actor Network.	ISNN (3)	2009	DBLP DOI BibTeX RDF	WSAN, Key Ring, WSN, Key Pre-distribution, Rooted-Tree
48	Yusuke Suzuki, Kohtaro Inomae, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida	A Polynomial Time Matching Algorithm of Structured Ordered Tree Patterns for Data Mining from Semistructured Data.	ILP	2002	DBLP DOI BibTeX RDF
42	Konstantinos Mastakas	Drawing a rooted tree as a rooted y-monotone minimum spanning tree.	Inf. Process. Lett.	2021	DBLP DOI BibTeX RDF
42	Konstantinos Mastakas	Drawing a Rooted Tree as a Rooted y-Monotone Minimum Spanning Tree.	CoRR	2018	DBLP BibTeX RDF
41	Kazuhide Aikou, Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara	A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables.	CPM	2005	DBLP DOI BibTeX RDF
40	Ahmed Housni, Michel Tréhel	Distributed Mutual Exclusion Token-Permission Based by Prioritized Groups.	AICCSA	2001	DBLP DOI BibTeX RDF	Algorithm, Groups, Priority, Token, permission, Distributed Mutual Exclusion, Rooted tree
40	Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida, Tetsuhiro Miyahara	Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables.	ALT	2003	DBLP DOI BibTeX RDF
38	Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tomoyuki Uchida	Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data.	ILP	2003	DBLP DOI BibTeX RDF
36	Yun Chi, Yirong Yang, Richard R. Muntz	HybridTreeMiner: An Efficient Algorithm for Mining Frequent Rooted Trees and Free Trees Using Canonical Form.	SSDBM	2004	DBLP DOI BibTeX RDF	tree iso-morphism, enumeration tree, rooted unordered tree, free tree, canonical form, frequent subtree
34	Lih-Hsing Hsu, Jones J. J. Wang	Undordered Tree Contraction.	ICCI	1991	DBLP DOI BibTeX RDF
32	Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara	Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data.	ALT	2002	DBLP DOI BibTeX RDF
31	Yusuke Suzuki, Takayoshi Shoudai, Satoshi Matsumoto, Tetsuhiro Miyahara	Polynomial Time Inductive Inference of Ordered Tree Languages with Height-Constrained Variables from Positive Data.	PRICAI	2004	DBLP DOI BibTeX RDF
28	H. A. Donegan, G. E. Livesey, T. B. M. McMaster, G. J. McAleavy	Axiomatic considerations of a rule based mechanism for the determination of a building's egress capability.	Artif. Intell. Rev.	2007	DBLP DOI BibTeX RDF	Building evacuation, Egress complexity, Entropy, Floorplan, Rooted tree
28	Ander Murua	The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series.	Found. Comput. Math.	2006	DBLP DOI BibTeX RDF	Free Lie algebra, Continous BCH function, Hopf algbra of rooted trees, Hall rooted trees, Lie series, Dual PBW basis, Rewritting algorithm, Logarithm of Chenn-Fliess series, Series of vector fields, Rooted tree
28	Doowon Paik, Sudhakar M. Reddy, Sartaj Sahni	Deleting Vertices to Bound Path Length.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	vertex deletion problem, path length bound, weighted directed acyclic graphs, quadratic time, computational complexity, directed graphs, NP-hard problems, linear time, series-parallel graph, rooted tree
28	Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal	A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	token-based distributed mutualexclusion algorithms, tree-based distributed mutual exclusion algorithms, permission-based mutual exclusion algorithms, rooted tree structure, informationstructure, topology requirements, distributed algorithms, distributed algorithms, topology, tree data structures, generic algorithm
28	K. Vidyasankar	A Non-Two Phase Locking Protocol for Global Concurrency Control in Distributed Heterogeneous Database Systems.	IEEE Trans. Knowl. Data Eng.	1991	DBLP DOI BibTeX RDF	non-two-phase locking protocol, global concurrency control, distributed heterogeneous database systems, global transactions, database sites, rooted tree fashion, global transaction manager, GTM, g-local transactions, concurrency control mechanism, local transactions, g-local transactions, protocols, distributed databases, concurrency control, transaction processing, system recovery, serializability, deadlock freedom, general architecture
27	Borislav V. Minchev	Integrating Factor Methods as Exponential Integrators.	LSSC	2005	DBLP DOI BibTeX RDF
26	Satoshi Matsumoto, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida	Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries.	Australian Joint Conference on Artificial Intelligence	2002	DBLP DOI BibTeX RDF
26	Sylvain Béal, Eric Rémila, Philippe Solal	Rooted-tree solutions for tree games.	Eur. J. Oper. Res.	2010	DBLP DOI BibTeX RDF
26	Hiroshi Nagamochi, Kohei Okada	Approximating the minmax rooted-tree cover in a tree.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
25	Kazuyoshi Furukawa, Tomoyuki Uchida, Kazuya Yamada, Tetsuhiro Miyahara, Takayoshi Shoudai, Yasuaki Nakamura	Extracting Characteristic Structures among Words in Semistructured Documents.	PAKDD	2002	DBLP DOI BibTeX RDF
23	Norman Y. Foo, Pavlos Peppas, Yan Zhang 0003	Inductive Properties of States.	Australian Joint Conference on Artificial Intelligence	1997	DBLP DOI BibTeX RDF	induction, actions, states, automaton, situation calculus
22	Satoshi Matsumoto, Yusuke Suzuki, Takayoshi Shoudai, Tetsuhiro Miyahara, Tomoyuki Uchida	Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries.	ALT	2003	DBLP DOI BibTeX RDF
22	Jean R. S. Blair, Fredrik Manne	Efficient Self-stabilizing Algorithms for Tree Network.	ICDCS	2003	DBLP DOI BibTeX RDF
22	Stephen Alstrup, Cyril Gavoille, Haim Kaplan, Theis Rauhe	Nearest common ancestors: a survey and a new distributed algorithm.	SPAA	2002	DBLP DOI BibTeX RDF	ancestor, distributed, labeling
22	Michel Tréhel, Ahmed Housni	The Prioritized and Distributed Synchronization in Distributed Groups.	International Conference on Computational Science (1)	2001	DBLP DOI BibTeX RDF
22	Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki	Vehicle Scheduling on a Tree with Release and Handling Times.	ISAAC	1993	DBLP DOI BibTeX RDF
21	Dong Hua, Dechang Chen, Xiuzhen Cheng 0001, Abdou Youssef	Latent Structure Models for the Analysis of Gene Expression Data.	CSB	2003	DBLP DOI BibTeX RDF
21	Rong Lin, Stephan Olariu	A Simple Optimal Parallel Algorithm to Solve the Lowest Common Ancestor Problem.	ICCI	1991	DBLP DOI BibTeX RDF	parallel algorithms, EREW-PRAM, list ranking, lowest common ancestors, ordered trees, Euler tour
21	Paraschos Koutris, Xiating Ouyang, Jef Wijsen	Consistent Query Answering for Primary Keys on Rooted Tree Queries.	CoRR	2023	DBLP DOI BibTeX RDF
21	Pengxiang Pan, Junran Lichen, Ping Yang, Jianping Li	The Heterogeneous Rooted Tree Cover Problem.	COCOON (2)	2023	DBLP DOI BibTeX RDF
21	Hervé L. M. Kerivin, Jinhua Zhao	Bounded-degree rooted tree and TDI-ness.	RAIRO Oper. Res.	2022	DBLP DOI BibTeX RDF
21	Hervé Kerivin, Jinhua Zhao	A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem.	Appl. Math. Comput.	2022	DBLP DOI BibTeX RDF
21	Adel Aghajan, Behrouz Touri	Ergodicity of Continuous-Time Distributed Averaging Dynamics: A Spanning Directed Rooted Tree Approach.	IEEE Trans. Autom. Control.	2022	DBLP DOI BibTeX RDF
21	Badre Bossoufi, Mohammed Karim, Mohammed Taoussi, Hala Alami Aroussi, Manale Bouderbala, Olivier Deblecker, Saad Motahhir, Anand Nayyar, Mohammed A. Alzain	Rooted Tree Optimization for the Backstepping Power Control of a Doubly Fed Induction Generator Wind Turbine: dSPACE Implementation.	IEEE Access	2021	DBLP DOI BibTeX RDF
21	Abdul Wadood, Tahir Khurshaid, Saeid Gholami Farkoush, Chang-Hwan Kim, Sang-Bong Rhee	A Bio-Inspired Rooted Tree Algorithm for Optimal Coordination of Overcurrent Relays.	INTAP	2018	DBLP DOI BibTeX RDF
21	Xianyang Zeng, Hongli Yang, Xinyuan Wu	An improved tri-coloured rooted-tree theory and order conditions for ERKN methods for general multi-frequency oscillatory systems.	Numer. Algorithms	2017	DBLP DOI BibTeX RDF
21	Nilesh Vyas, Debashis Saha, Prasanta K. Panigrahi	Rooted-tree network for optimal non-local gate implementation.	Quantum Inf. Process.	2016	DBLP DOI BibTeX RDF
21	Laurent Galluccio, Olivier J. J. Michel, Pierre Comon, Mark Kliger, Alfred O. Hero III	Clustering with a new distance measure based on a dual-rooted tree.	Inf. Sci.	2013	DBLP DOI BibTeX RDF
21	Naoki Katoh, Shin-ichi Tanigawa	Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries.	SIAM J. Discret. Math.	2013	DBLP DOI BibTeX RDF
21	Hans-Jörg Schulz, Zabedul Akbar, Frank Maurer	A generative layout approach for rooted tree drawings.	PacificVis	2013	DBLP DOI BibTeX RDF
21	Emeric Deutsch	Rooted tree statistics from Matula numbers.	Discret. Appl. Math.	2012	DBLP DOI BibTeX RDF
21	Hervé Kerivin, Jimmy Leblet, Gwendal Simon, Fen Zhou 0001	Maximum Bounded Rooted-Tree Packing Problem	CoRR	2011	DBLP BibTeX RDF
21	Naoki Katoh, Shin-ichi Tanigawa	Rooted-tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with Boundaries	CoRR	2011	DBLP BibTeX RDF
21	Mykhaylo Tyomkyn	A proof of the rooted tree alternative conjecture.	Discret. Math.	2009	DBLP DOI BibTeX RDF
21	Stephan G. Wagner	On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups.	Electron. J. Comb.	2006	DBLP DOI BibTeX RDF
21	José Luis Ruiz, Mercè Mora	De Bruijn and Kautz digraphs of a rooted tree.	Discret. Math.	2005	DBLP DOI BibTeX RDF
21	Laurent Bartholdi	Lower Bounds on The Growth of a Group Acting on the Binary Rooted Tree.	Int. J. Algebra Comput.	2001	DBLP DOI BibTeX RDF
21	Radha Poovendran, John S. Baras	An information-theoretic approach for design and analysis of rooted-tree-based multicast key management schemes.	IEEE Trans. Inf. Theory	2001	DBLP DOI BibTeX RDF
21	Franck Petit, Vincent Villain	Optimality and Self-Stabilization in Rooted Tree Networks.	Parallel Process. Lett.	2000	DBLP DOI BibTeX RDF
21	Rossen Stefanov	Interval representation of a rooted tree with an order of the immediate children.	CompSysTech	2000	DBLP DOI BibTeX RDF
21	Franck Petit, Vincent Villain	Optimality and Self-Stabilization in Rooted Tree Networks.	Parallel Process. Lett.	1999	DBLP DOI BibTeX RDF
21	Radha Poovendran, John S. Baras	An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes.	CRYPTO	1999	DBLP DOI BibTeX RDF
21	Michael Mitzenmacher	Constant Time per Edge is Optimal on Rooted Tree Networks.	SPAA	1996	DBLP DOI BibTeX RDF
21	Yoshiko Ikebe, Micha A. Perles, Akihisa Tamura, Shinnichi Tokunaga	The Rooted Tree Embedding Problem into Points in the Plane.	Discret. Comput. Geom.	1994	DBLP DOI BibTeX RDF
21	Paul N. Hilfinger, Eugene L. Lawler, Günter Rote	Flattening a Rooted Tree.	Applied Geometry And Discrete Mathematics	1990	DBLP DOI BibTeX RDF
21	Jayme Luiz Szwarcfiter	On digraphs with a rooted tree structure.	Networks	1985	DBLP DOI BibTeX RDF
20	Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei	Supertree Construction with Constraint Programming.	CP	2003	DBLP DOI BibTeX RDF
20	Alexander Zelikovsky, Ion I. Mandoiu	Practical approximation algorithms for zero- and bounded-skew trees.	SODA	2001	DBLP BibTeX RDF
19	Tatsuya Akutsu, Daiji Fukagawa, Atsuhiro Takasu	Approximating Tree Edit Distance Through String Edit Distance.	ISAAC	2006	DBLP DOI BibTeX RDF
17	James Allen Fill, Nevin Kapur, Alois Panholzer	Destruction of Very Simple Trees.	Algorithmica	2006	DBLP DOI BibTeX RDF
17	Irene Finocchi, Rossella Petreschi	Structure-Preserving Hierarchical Decompositions.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
17	Ole Fogh Olsen	Tree Edit Distances from Singularity Theory.	Scale-Space	2005	DBLP DOI BibTeX RDF
17	Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo	Integral Trees: Subtree Depth and Diameter.	IWCIA	2004	DBLP DOI BibTeX RDF
17	Alain Bui, Ajoy Kumar Datta, Franck Petit, Vincent Villain	Space optimal PIF algorithm: self-stabilized with no extra space.	IPCCC	1999	DBLP DOI BibTeX RDF
17	Alan Roberts, Antonios Symvonis	On-Line Matching Routing on Trees.	LATIN	1998	DBLP DOI BibTeX RDF
15	Hao Yuan, Mikhail J. Atallah	Efficient data structures for range-aggregate queries on trees.	ICDT	2009	DBLP DOI BibTeX RDF	range aggregation, query answering
15	Hsueh-I Lu, Chia-Chi Yeh	Balanced parentheses strike back.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	XML document representation, Succinct data structures
15	Paul S. Bonsma, Frederic Dorn	Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree.	ESA	2008	DBLP DOI BibTeX RDF
15	Doina Bein, Ajoy Kumar Datta, Lawrence L. Larmore	Self-stabilizing algorithms for sorting and heapification.	IPDPS	2008	DBLP DOI BibTeX RDF
15	Venkatraman Ramakrishna, Max Robinson, Kevin Eustice, Peter L. Reiher	An Active Self-Optimizing Multiplayer Gaming Architecture.	Clust. Comput.	2006	DBLP DOI BibTeX RDF	Self-optimizing middleware, Packet aggregation, Multicast, Active networks, Multiplayer games
15	Guido Proietti, Peter Widmayer	A truthful mechanism for the non-utilitarian minimum radius spanning tree problem.	SPAA	2005	DBLP DOI BibTeX RDF	pricing and equilibria in networks, algorithmic mechanism design, selfish agents, truthful mechanisms
15	Grzegorz Kubicki, Jenö Lehel, Michal Morayne	An Asymptotic Ratio in the Complete Binary Tree.	Order	2003	DBLP DOI BibTeX RDF	tree poset, embedding, enumeration
15	Yaw-Ling Lin, Tsan-sheng Hsu	Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome.	ISAAC	2003	DBLP DOI BibTeX RDF
15	Evangelos Kranakis, Danny Krizanc, Sunil M. Shende	Approximate Hotlink Assignment.	ISAAC	2001	DBLP DOI BibTeX RDF
15	Serge Abiteboul, Haim Kaplan, Tova Milo	Compact labeling schemes for ancestor queries.	SODA	2001	DBLP BibTeX RDF
15	Stephen Alstrup, Jacob Holm	Improved Algorithms for Finding Level Ancestors in Dynamic Trees.	ICALP	2000	DBLP DOI BibTeX RDF
15	Ming-Yang Kao	Tree Contractions and Evolutionary Trees.	CIAC	1997	DBLP DOI BibTeX RDF
15	François Bergeron, Philippe Flajolet, Bruno Salvy	Varieties of Increasing Trees.	CAAP	1992	DBLP DOI BibTeX RDF
13	Stanislav Angelov, Sanjeev Khanna, Keshav Kunal	The Network as a Storage Device: Dynamic Routing with Bounded Buffers.	Algorithmica	2009	DBLP DOI BibTeX RDF	Troughput maximization, Online algorithms, Network routing
13	Karim Douïeb, Stefan Langerman	Dynamic Hotlinks.	Algorithmica	2008	DBLP DOI BibTeX RDF	Hotlink assignment, Jumplist, Amortization
13	Akram Shehadi Saynez, María Josefa Somodevilla García, Manuel Martín Ortiz, Ivo Humberto Pineda Torres	H-Tree: A data structure for fast path-retrieval in rooted trees.	ENC	2007	DBLP DOI BibTeX RDF
13	Karim Douïeb, Stefan Langerman	Near-Entropy Hotlink Assignments.	ESA	2006	DBLP DOI BibTeX RDF
13	Josiah Carlson, David Eppstein	The Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems.	SWAT	2006	DBLP DOI BibTeX RDF
13	Zeshan Peng	Algorithms for Local Forest Similarity.	ISAAC	2005	DBLP DOI BibTeX RDF
13	Karim Douïeb, Stefan Langerman	Dynamic Hotlinks.	WADS	2005	DBLP DOI BibTeX RDF
13	Arjan Kuijper	Exploiting Deep Structure.	DSSCV	2005	DBLP DOI BibTeX RDF
13	Stanislav Angelov, Sanjeev Khanna, Keshav Kunal	The Network as a Storage Device: Dynamic Routing with Bounded Buffers.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
13	Ofer Dekel, Joseph Keshet, Yoram Singer	Large margin hierarchical classification.	ICML	2004	DBLP DOI BibTeX RDF
13	Ofer Dekel, Joseph Keshet, Yoram Singer	An Online Algorithm for Hierarchical Phoneme Classification.	MLMI	2004	DBLP DOI BibTeX RDF
13	Pavel Valtr 0001	Davenport-Schinzel Trees.	Comb.	2003	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 52C10, 68R15, 05C78, 68U05