Analysis
LNCS
Racine
Analysis
LNCS
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur l'Université de Trèves

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Le cluster leaf - spanning

Terms

3leaf
4spanning
11tree
4maximum
8exact
6algorithm
3grammars
8new

Associations

Freq.WeightAssociation
30.866leaf - spanning
40.603spanning - tree
20.577leaf - maximum
30.530exact - spanning
30.530exact - maximum
30.522leaf - tree
20.500maximum - spanning
20.471algorithm - leaf
20.408exact - leaf
20.408algorithm - spanning
20.408algorithm - maximum
20.348grammars - tree
30.320exact - tree
20.302maximum - tree
20.289algorithm - new
20.289algorithm - exact
20.246algorithm - tree
Documents par ordre de pertinence
000030 (2010) Daniel Binkele-Raible [Allemagne] ; Henning Fernau [Allemagne]A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem
000040 (2009) Henning Fernau [Allemagne] ; Joachim Kneis [Allemagne] ; Dieter Kratsch [France] ; Alexander Langer [Allemagne] ; Mathieu Liedloff [France] ; Daniel Raible [Allemagne] ; Peter Rossmanith [Allemagne]An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
000023 (2010) Henning Fernau [Allemagne] ; Serge Gaspers [France] ; Daniel Raible [Allemagne]Exact and Parameterized Algorithms for Max Internal Spanning Tree
000028 (2010) Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]An Amortized Search Tree Analysis for k -Leaf Spanning Tree
000002 (2011) Anna Kasprzik [Allemagne] ; Ryo Yoshinaka [Japon]Distributional Learning of Simple Context-Free Tree Grammars
000033 (2009) Anna KasprzikTwo Equivalent Regularizations for Tree Adjoining Grammars
000050 (2008) Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
000218 (2001) Valérie Gouranton [France] ; Pierre Réty [France] ; Helmut Seidl [Allemagne]Synchronized Tree Languages Revisited and New Applications
000246 (1998) Christian Fecht [Allemagne] ; Helmut Seidl [Allemagne]Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems
000268 (1997) Klaus Jansen [Allemagne] ; Joachim Reiter [Allemagne]A new approximation algorithm for the register allocation problem
000006 (2011) Anna Kasprzik [Allemagne]Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
000010 (2011) Pinar Heggernes [Norvège] ; Daniel Meister [Allemagne] ; Udi Rotics [Israël]Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width
000022 (2010) Christophe Costa Florêncio [Belgique] ; Henning Fernau [Allemagne]Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach
000029 (2010) Daniel Binkele-Raible [Allemagne] ; Ljiljana Brankovic [Australie] ; Henning Fernau [Allemagne] ; Joachim Kneis [Allemagne] ; Dieter Kratsch [France] ; Alexander Langer [Allemagne] ; Mathieu Liedloff [France] ; Peter Rossmanith [Allemagne]A Parameterized Route to Exact Puzzles: Breaking the 2 n -Barrier for Irredundance
000044 (2008) Anna Kasprzik [Allemagne]A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness
000051 (2008) Guoqiang Bai [Allemagne] ; Henning Fernau [Allemagne]Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
000055 (2008) Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach
000070 (2006) Ralph Bergmann (informaticien) [Allemagne] ; Babak Mougouie [Allemagne]Finding Similar Deductive Consequences – A New Search-Based Framework for Unified Reasoning from Cases and General Knowledge
000073 (2006) Henning Fernau [Allemagne]edge dominating set : Efficient Enumeration-Based Exact Algorithms
000081 (2005) Hiromichi Fujisawa [Japon] ; Larry Kerschberg [États-Unis]Workshop on Information Just-in-Time (WIJIT2005): Seeking a New Knowledge Management Paradigm
000108 (2005) Guido Dedene [Belgique, Pays-Bas] ; Monique Snoeck [Belgique] ; Manu De Backer [Belgique] ; Wilfried Lemahieu [Belgique]New Generation E-Learning Technology by Web Services
000178 (2004) Mohammad Ghasemzadeh [Allemagne] ; Volker Klotz [Allemagne] ; Christoph Meinel [Allemagne]Embedding Memoization to the Semantic Tree Search for Deciding QBFs
000204 (2002) Camil Demetrescu [Italie] ; Irene Finocchi [Italie] ; Giuseppe F. Italiano [Italie] ; Stefan N Her [Allemagne]Visualization in Algorithm Engineering: Tools and Techniques
000217 (2001) Norbert Th. Müller [Allemagne]The iRRAM: Exact Arithmetic in C++
000251 (1998) Andreas Neumann [Allemagne] ; Helmut Seidl [Allemagne]Locating Matches of Tree Patterns in Forests
000302 (1993) Klaus Jansen [Allemagne] ; Petra Scheffler [Allemagne] ; Gerhard J. Woeginger [Autriche]Maximum covering with D cliques
000303 (1993) Klaus Jansen ; Petra SchefflerGeneralized coloring for tree-like graphs
Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024