Buscar
Mostrando ítems 11-20 de 308
Coordinated graphs and clique graphs of clique-Helly perfect graphs
(2007)
A new class of graphs related to perfect graphs is defined in this work: coordinated graphs. A graph G is coordinated if the cardinality of a maximum set of cliques of H with a common vertex is equal to the cardinality of ...
Bijective proofs using two-line matrix representations for partitions
(SpringerDordrechtHolanda, 2010)
Covering graphs with convex sets and partitioning graphs into convex sets
(Elsevier Science, 2020-06)
We present some complexity results concerning the problems of covering a graph with p convex sets and of partitioning a graph into p convex sets. The following convexities are considered: digital convexity, monophonic ...
Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
(Instituto Politécnico Nacional, 2017)
Low-Exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs
(Computación y Sistemas, 2017)
Graph partitioning-based clustering for the planning of distribution network topology using spatial- temporal load forecasting
(2021-09-15)
Planning the expansion and the new topology of distribution networks requires knowing the location and characterization of the load as well as its future growth. Spatial load forecasting is a key tool in this task, providing ...
Formulations and valid inequalities for the node capacitated graph partitioning problem
(SpringerNew YorkEUA, 1996)
On probe 2-clique graphs and probe diamond-free graphs
(Discrete Mathematics and Theoretical Computer Science, 2015)
Given a class G of graphs, probe G graphs are defined as follows. A graph G is probe G if there exists a partition of its vertices into a set of probe vertices and a stable set of nonprobe vertices in such a way that ...
StructMatrix: large-scale visualization of graphs by means of structure detection and dense matrices
(Institute of Electrical and Electronics Engineers – IEEEAtlantic City, 2015-11)
Given a large-scale graph with millions of nodes and edges, how to reveal macro patterns of interest, like cliques, bi-partite cores, stars, and chains? Furthermore, how to visualize such patterns altogether getting insights ...