Search Sciweavers | Sciweavers

14

COLING
2000

81views Computational Linguistics» more COLING 2000»

Context-Free Grammar Rewriting and the Transfer of Packed Linguistic Representations

13 years 7 months ago

We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...

Marc Dymetman, Frédéric Tendeau

claim paper

Read More »

13

click to vote

COCOA
2008
Springer

88views Discrete Geometry» more COCOA 2008»

A Parameterized Perspective on Packing Paths of Length Two

13 years 7 months ago

Download www.informatik.uni-trier.de

We study (vertex-disjoint) packings of paths of length two (i.e., of P2's) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use e...

Henning Fernau, Daniel Raible

claim paper

Read More »

19

click to vote

JCO
2007

122views more JCO 2007»

Packing 5-cycles into balanced complete m -partite graphs for odd m

13 years 5 months ago

Download www.math.nctu.edu.tw

Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...

Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu

claim paper

Read More »

16

click to vote

DM
2008

88views more DM 2008»

Packing triangles in low degree graphs and indifference graphs

13 years 5 months ago

Download www.ime.usp.br

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algor...

Gordana Manic, Yoshiko Wakabayashi

claim paper

Read More »

14

click to vote

CSR
2007
Springer

106views Theoretical Computer Science» more CSR 2007»

Combinatorial and computational aspects of graph packing and graph decomposition

13 years 5 months ago