10940084
Hamiltonian Graphs with Large Neighborhood Unions
19566771
Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups
We prove that every Cayley graph on a finite solvable group admits a nowhere-zero 4-flow. In particular, every cubic Cayley graph on a solvable group is 3-edge-colorable.
5533376
Characterizations of maximum matching graphs of certain types
The maximum matching graph M(G) of a graph G is a graph whose vertices are maximum matchings of G and where two maximum matchings are adjacent in M(G) if they differ in exactly one edge. In this paper, the author characterizes the graphs whose maximum matching graphs are regular or cycles, and adds trees to the list of known maximum matching graphs.
6564204
A robust method for shape-based 3D model retrieval
Proliferation of 3D models necessitates developing efficient methods for indexing or retrieving the models in a large database. Many previous methods for this purpose defined functions on concentric spheres as approximation of 3D geometry for spherical harmonic transform (SHT). In this paper, we point out that this is not robust as the surface of a model may shift between different shells under perturbation, and multi-layer of surfaces may exist in one shell, making the function definition ambiguous. To solve these problems, we propose a method to characterize 3D shape using delta functions. Then, spherical functions are defined by sampling in the frequency domain of the delta functions for SHT. By doing so, our method can support retrieval with controllable acuity, which benefits wider range of applications and facilitates customization to different users. Experiments have shown that our method is more robust than previous approaches.
16104127
Bilateral Filter for Meshes Using New Predictor
A new predictor of bilateral filter for smoothing meshes is presented. It prevents shrinkage of corners. A major feature of mesh smoothing is to move every vertex along the direction determined by the mean curvature normal with speed defined by the predictor. It prevents unnatural deformation for irregular meshes. In order to remove thenormal noise, we use adaptive Gaussian filter to smooth triangle normals.
34451404
The enumeration of near-perfect matchings of factor-critical graphs
Abstract A matching of a graph is a near-perfect matching if it covers all but one vertex. A connected graph G is said to be factor-critical if G − v has perfect matchings for every vertex v of G. In this paper, the enumeration problems for near-perfect matchings in special factor-critical graphs are solved. From this, the exact values of the number of perfect matchings in special bicritical graphs are obtained.
13098192
On the impact of concurrent downloads
Concurrent downloads accelerate information access speed for individual Web users. The speed-up comes from multiple connections launched for one subject download, which leads to unfairness at user level. We study the impact of concurrent downloads on the network. Particularly, we investigate the fairness between users who employ different downloading concurrency. We also discuss how concurrent downloads affect the transient behavior of the network.