Search
Search Results
-
Maximal Ordinal Two-Factorizations
Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the...
-
Efficient Computation of K-Edge Connected Components: An Empirical Analysis
Graphs play a pivotal role in representing complex relationships across various domains, such as social networks and bioinformatics. Key to many...
-
Maximal Independent Sets for Pooling in Graph Neural Networks
Convolutional Neural Networks (CNNs) have enabled major advances in image classification through convolution and pooling. In particular, image...
-
Local 2-connected bow-tie structure of the Web and of social networks
The explosive growth of the Web and of social networks motivates the need for analyzing the macroscopic structure of their underlying graphs....
-
Minimum Maximal Acyclic Matching in Proper Interval Graphs
Given a graph G, Min-Max-Acy-Matching is the problem of finding a maximal matching M in G of minimum cardinality such that the set of M-saturated...
-
Mining Maximal High Utility Co-location Patterns from Large-Scale Spatial Data
High utility co-location patterns (HUCPs), which are groups of spatial features considering the utility values of these spatial features, can...
-
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs
We propose efficient algorithms for enumerating the celebrated combinatorial structures of maximal planar graphs, called canonical orderings and...
-
Connected coordinated motion planning with bounded stretch
We consider the problem of connected coordinated motion planning for a large collective of simple, identical robots: From a given start grid...
-
Maximum Matching Sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model
The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer...
-
On maximal partial Latin hypercubes
A lower bound is presented for the minimal number of filled cells in a maximal partial Latin hypercube of dimension d and order n . The result...
-
Discovering Maximal High Utility Co-location Patterns from Spatial Data
Compared with traditional prevalent co-location patterns (PCPs), high-utility co-location patterns (HUCPs), which consider the utility of spatial...
-
Maximal Prevalent Co-location Patterns
A novel maximal co-location pattern mining framework based on maximal cliques and hash tables (MCHT) is developed in this chapter. First, all maximal...
-
Enumeration of Minimal Tropical Connected Sets
A subset of vertices in a vertex-colored graph is called tropical if vertices of each color present in the subset. This paper is dedicated to the...
-
Distance Transform in Images and Connected Plane Graphs
The distance transform (DT) serves as a crucial operation in numerous image processing and pattern recognition methods, finding broad applications in...
-
Weighted Connected Matchings
A matching M is a \(\mathscr {P}\) -matching if...
-
On Computing Large Temporal (Unilateral) Connected Components
A temporal (directed) graph is a graph whose edges are available only at specific times during its lifetime,...
-
Maximal paths recipe for constructing Web user sessions
This paper introduces a new method for the session construction problem, which is the first main step of the Web usage mining process. The proposed...
-
Maximal Robust Neural Network Specifications via Oracle-Guided Numerical Optimization
Analyzing the robustness of neural networks is crucial for trusting them. The vast majority of existing works focus on networks’ robustness in...
-
Maximal Independent Vertex Set Applied to Graph Pooling
Convolutional neural networks (CNN) have enabled major advances in image classification through convolution and pooling. In particular, image pooling...
-
On the Maximal Independence Polynomial of the Covering Graph of the Hypercube up to n=6
There are well-known problems in extremal set theory that can be formulated as enumeration of the maximal independent sets or counting their total...