Open AccessBook
Graph Coloring Problems
Tommy R. Jensen,Bjarne Toft +1 more
Reads0
Chats0
TLDR
In this article, the Conjectures of Hadwiger and Hajos are used to define graph types, such as planar graph, graph on higher surfaces, and critical graph.Abstract:
Planar Graphs. Graphs on Higher Surfaces. Degrees. Critical Graphs. The Conjectures of Hadwiger and Hajos. Sparse Graphs. Perfect Graphs. Geometric and Combinatorial Graphs. Algorithms. Constructions. Edge Colorings. Orientations and Flows. Chromatic Polynomials. Hypergraphs. Infinite Chromatic Graphs. Miscellaneous Problems. Indexes.read more
Citations
More filters
Proceedings Article
LightGBM: a highly efficient gradient boosting decision tree
TL;DR: It is proved that, since the data instances with larger gradients play a more important role in the computation of information gain, GOSS can obtain quite accurate estimation of the information gain with a much smaller data size, and is called LightGBM.
Journal ArticleDOI
Characterization of complex networks: A survey of measurements
TL;DR: In this paper, the authors present a survey of topological features of complex networks, including trajectories in several measurement spaces, correlations between some of the most traditional measurements, perturbation analysis, as well as the use of multivariate statistics for feature selection and network classification.
Journal ArticleDOI
Characterization of complex networks: A survey of measurements
TL;DR: This article presents a survey of measurements capable of expressing the most relevant topological features of complex networks and includes general considerations about complex network characterization, a brief review of the principal models, and the presentation of the main existing measurements.
Book
Digraphs Theory Algorithms And Applications
Jrgen Bang-Jensen,Gregory Gutin +1 more
TL;DR: Digraphs is an essential, comprehensive reference for undergraduate and graduate students, and researchers in mathematics, operations research and computer science, and it will also prove invaluable to specialists in related areas, such as meteorology, physics and computational biology.
Proceedings ArticleDOI
Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network
Ashish Raniwala,Tzi-cker Chiueh +1 more
TL;DR: It is shown that intelligent channel assignment is critical to Hyacinth's performance, and distributed algorithms that utilize only local traffic load information to dynamically assign channels and to route packets are presented, and their performance is compared against a centralized algorithm that performs the same functions.
References
More filters
Book
The Probabilistic Method
TL;DR: A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.
Journal ArticleDOI
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Journal ArticleDOI
Some simplified NP-complete graph problems
TL;DR: This paper shows that a number of NP - complete problems remain NP -complete even when their domains are substantially restricted, and determines essentially the lowest possible upper bounds on node degree for which the problems remainNP -complete.
Journal ArticleDOI
The ellipsoid method and its consequences in combinatorial optimization
TL;DR: The method yields polynomial algorithms for vertex packing in perfect graphs, for the matching and matroid intersection problems, for optimum covering of directed cuts of a digraph, and for the minimum value of a submodular set function.