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 spanning - tree

Terms

4spanning
11tree
3leaf
11algorithms
8exact
4maximum
9search
3grammars

Associations

Freq.WeightAssociation
44spanning - tree
33leaf - tree
33leaf - spanning
44algorithms - exact
33exact - tree
33exact - spanning
33exact - maximum
22search - tree
22maximum - tree
22maximum - spanning
22leaf - maximum
22grammars - tree
22exact - leaf
11search - spanning
11leaf - search
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
000050 (2008) Henning Fernau [Allemagne] ; Daniel Raible [Allemagne]Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
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
000051 (2008) Guoqiang Bai [Allemagne] ; Henning Fernau [Allemagne]Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
000073 (2006) Henning Fernau [Allemagne]edge dominating set : Efficient Enumeration-Based Exact Algorithms
000178 (2004) Mohammad Ghasemzadeh [Allemagne] ; Volker Klotz [Allemagne] ; Christoph Meinel [Allemagne]Embedding Memoization to the Semantic Tree Search for Deciding QBFs
000006 (2011) Anna Kasprzik [Allemagne]Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data
000012 (2011) Binh-Minh Bui-Xuan [Norvège] ; Pinar Heggernes [Norvège] ; Daniel Meister [Allemagne] ; Andrzej Proskurowski [États-Unis]A Generic Approach to Decomposition Algorithms, with an Application to Digraph Decomposition
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
000035 (2009) Stefan N Her [Allemagne] ; Daniel Schmitt [Allemagne]Multi-core Implementations of Geometric Algorithms
000041 (2008) Babak Mougouie [Allemagne]Optimization Algorithms to Find Most Similar Deductive Consequences (MSDC)
000045 (2008) Daniel Raible [Allemagne] ; Henning Fernau [Allemagne]Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
000066 (2007) Artur Gajek [Allemagne] ; Stefan Klink [Allemagne] ; Patrick Reuther [Allemagne] ; Bernd Walter [Allemagne] ; Alexander Weber [Allemagne]Bibliographical Meta Search Engine for the Retrieval of Scientific Articles
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
000074 (2006) Henning Fernau [Allemagne, Royaume-Uni]Parameterized Algorithms for Hitting Set : The Weighted Case
000129 (2005) Makoto Iwayama [Japon] ; Yoshiki Niwa [Japon]Just-in-Time Interactive Document Search
000132 (2005) Simon Schenk [Allemagne, Niger]Introducing Social Aspects to Search in Peer-to-Peer Networks
000194 (2003) Ralph Bergmann (informaticien) [Allemagne] ; Klaus-Dieter Althoff [Allemagne] ; Sean Breen [Irlande (pays)] ; Mehmet Göker [États-Unis] ; Michel Manago [France] ; Ralph Traphöner [Allemagne] ; Stefan Wess [Allemagne]8. Developing Intelligent Catalog Search Applications
000203 (2002) Christoph Meinel [Allemagne] ; Harald Sack [Allemagne] ; Arno Wagner [Suisse]WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms
000210 (2002) Matthias B Sken [Allemagne] ; Stefan N Her [Allemagne]GeoWin A Generic Tool for Interactive Visualization of Geometric Algorithms
000213 (2002) Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne]Algorithms and Heuristics in VLSI Design
000217 (2001) Norbert Th. Müller [Allemagne]The iRRAM: Exact Arithmetic in C++
000218 (2001) Valérie Gouranton [France] ; Pierre Réty [France] ; Helmut Seidl [Allemagne]Synchronized Tree Languages Revisited and New Applications
000250 (1998) Stefan Edelkamp [Allemagne] ; Frank Reffel [Allemagne]OBDDs in heuristic search
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