Sciweavers

8810 search results - page 1388 / 1762
» Open. Closed. Open
Sort
View
175
Voted
JCT
2007
133views more  JCT 2007»
15 years 6 months ago
Biased graphs. VII. Contrabalance and antivoltages
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
Thomas Zaslavsky
JDWM
2007
86views more  JDWM 2007»
15 years 6 months ago
Predicting Future Customers via Ensembling Gradually Expanded Trees
Our LAMDAer team has won the PAKDD'06 Data Mining Competition (Open Category) Grand Champion. This report presents our solution to PAKDD'06 Data Mining Competition. Follo...
Yang Yu, De-Chuan Zhan, Xu-Ying Liu, Ming Li, Zhi-...
JFP
2007
104views more  JFP 2007»
15 years 6 months ago
Understanding functional dependencies via constraint handling rules
Functional dependencies are a popular and useful extension to Haskell style type classes. We give a reformulation of functional dependencies in terms of Constraint Handling Rules ...
Martin Sulzmann, Gregory J. Duck, Simon L. Peyton ...
JGT
2007
99views more  JGT 2007»
15 years 6 months ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...
JGT
2007
73views more  JGT 2007»
15 years 6 months ago
New bounds on the edge number of a k-map graph
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
Zhi-Zhong Chen
« Prev « First page 1388 / 1762 Last » Next »