Showing 21 - 40 of 70

21

Overlapping Community Detection by Local Decentralised Vertex-centred Process
Canu, Maël ; Lesot, Marie-Jeanne ; Revault d'Allonnes, Adrien ; et al.
2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW'16). :77-84

Barcelone, Spain seed-centric vertex-centred complex networks community detection leader-based
Conference
Save to List
22

Vertex-centred Method to Detect Communities in Evolving Networks
Canu, Maël ; Lesot, Marie-Jeanne ; Revault d'Allonnes, Adrien ; et al.
Fifth International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016). :275-286

Milan, Italy Graph Clustering Graph Algorithms Complex network analysis Complex networks Evolving Clustering Meth...
Conference
Save to List
23

CycleExpander to construct Directed Hamiltonian Circuit HexCycleSpanner to tighten Directed Hamiltonian Circuit
Halemane, Keshava Prasad ; National Institute of Technology Karnataka [Surathkal] (NITK) ; SASHESHA
[Research Report] SASHESHA. 2022

Optimization Algorithm Computational Complexity Asymmetric Travelling Sa... Shortest Directed Hamilt... HexCycleSpanner
Report
Save to List
24

CycleExpander to construct Directed Hamiltonian Circuit HexCycleSpanner to tighten Directed Hamiltonian Circuit
Halemane, Keshava Prasad ; National Institute of Technology Karnataka [Surathkal] (NITK) ; SASHESHA
[Research Report] SASHESHA. 2022

Optimization Algorithm Computational Complexity Asymmetric Travelling Sa... Shortest Directed Hamilt... HexCycleSpanner
Report
Save to List
25

CycleExpander to construct Directed Hamiltonian Circuit HexCycleSpanner to tighten Directed Hamiltonian Circuit
Halemane, Keshava Prasad ; National Institute of Technology Karnataka [Surathkal] (NITK) ; SASHESHA
[Research Report] SASHESHA. 2022

Optimization Algorithm Computational Complexity Asymmetric Travelling Sa... Shortest Directed Hamilt... HexCycleSpanner
Report
Save to List
26

CycleExpander to construct Directed Hamiltonian Circuit HexCycleSpanner to tighten Directed Hamiltonian Circuit
Halemane, Keshava Prasad ; National Institute of Technology Karnataka [Surathkal] (NITK) ; SASHESHA
[Research Report] SASHESHA. 2022

Optimization Algorithm Computational Complexity Asymmetric Travelling Sa... Shortest Directed Hamilt... HexCycleSpanner
Report
Save to List
27

HexCycleSpanner to tighten Directed Hamiltonian Circuit CycleExpander to construct Directed Hamiltonian Circuit
HALEMANE, KESHAVA PRASAD ; National Institute of Technology Karnataka [Surathkal] (NITK) ; SASHESHA
[Research Report] SASHESHA. 2022

Optimization Algorithm Computational Complexity Asymmetric Travelling Sa... Shortest Directed Hamilt... HexCycleSpanner
Report
Save to List
28

Robust Basic Cyclic Scheduling Problem
Hamaz, Idir ; Houssin, Laurent ; Cafieri, Sonia ; et al.
EURO Journal on Computational Optimization. 6(3):291-313

ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.1: Combinatorics G.2.1.0: Combinatorial a... G.2.2: Graph Theory G.2.2.0: Graph algorithm...
Journal
Save to List
29

BRANE Clust: Cluster-Assisted Gene Regulatory Network Inference Refinement
Pirayre, Aurélie ; Couprie, Camille ; Duval, Laurent ; et al.
IEEE/ACM Transactions on Computational Biology and Bioinformatics. 15(3):850-860

Transcriptomic data Combinatorial optimizati... network inference Graph Clustering Gene regulation network DREAM Challenge
Journal
Save to List
30

An $O(\log \mathrm {OPT})$-Approximation for Covering and Packing Minor Models of $\theta _r$
Chatzidimitriou, Dimitris ; Raymond, Jean-Florent ; Sau, Ignasi ; et al.
Algorithmica. 80(4):1330-1356

Protrusion decomposition Minor-models of θ Coverings in graph Erdős–Pósa property Approximation algorithm Packings in graphs
Journal
Save to List
31

Fast community structure local uncovering by independent vertex-centred process
Canu, Maël ; Detyniecki, Marcin ; Lesot, Marie-Jeanne ; et al.
2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. :823-830

Paris, France distributed computing community detection social networks graph mining communications
Conference
Save to List
32

Extension of universal cycles for globally identifying colorings of cycles
Coupechoux, Pierre ; Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes (LAAS-ROC) ; Laboratoire d'analyse et d'architecture des systèmes (LAAS) ; et al.
Discrete Mathematics. 340(7):1456-1466

Graph Theory Universal Cycles 2010 MS... Identifying codes Identifying coloring Cycles 05C38
Journal
Save to List
33

Linear-time Constant-ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs
Crespelle, Christophe ; Gambette, Philippe ; Dynamic Networks : Temporal and Structural Capture Approach (DANTE) ; et al.
Seventh International Workshop on Algorithms and Computation. :126-136

Kharagpur, India ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory G.2.2.0: Graph algorithm... [INFO.INFO-DS]Computer S...
Conference
Save to List
34

Impact Of The Energy Model On The Complexity Of RNA Folding With Pseudoknots
Sheikh, Saad ; Backofen, Rolf ; Ponty, Yann ; et al.
CPM - 23rd Annual Symposium on Combinatorial Pattern Matching - 2012. :321-333

Helsinki, Finland RNA folding General pseudoknots Hardness Inapproximability ACM: J.: Computer Applic...
Conference
Save to List
35

Structural Differences Between Two Graphs through Hierarchies
Archambault, Daniel ; Laboratoire Bordelais de Recherche en Informatique (LaBRI) ; Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS) ; et al.
Graphics Interface. :87-94

Kelowna, Canada ACM: H.: Information Sys... H.5: INFORMATION INTERFA... H.5.0: General ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC...
Conference
Save to List
36

TugGraph: Path-Preserving Hierarchies for Browsing Proximity and Paths in Graphs
Archambault, Daniel ; Munzner, Tamara ; Auber, David ; et al.
IEEE Pacific Visualization Symposium. :113-121

Pekin, China Graph Visualization Proximity Graph Hierarchies ACM: H.: Information Sys... H.5: INFORMATION INTERFA...
Conference
Save to List
37

Generalized Attachment Models for the Genesis of Graphs with High Clustering Coefficient
Gustedt, Jens ; Algorithms for the Grid (ALGORILLE) ; INRIA Lorraine ; et al.
Santo Fortunato and Giuseppe Mangioni and Ronaldo Menezes and Vincenzo Nicosia. Complex Networks - Results of the 2009 International Workshop on Complex Networks (CompleNet 2009). :99-113

attachment models random graph generation k-trees ACM: F.: Theory of Compu... F.2: ANALYSIS OF ALGORIT... F.2.2: Nonnumerical Algo...
Book
Save to List
38

Converting Hybrid Wire-frames to B-rep Models
Gong, Jie-Hui ; Zhang, Hui ; Zhang, Yi-Wen ; et al.
SPM '07: Proceedings of the 2007 ACM symposium on Solid and physical modeling. :283-289

Beijing, China 2-manifold Möbius rule graph theory model conversion solid reconstruction
Conference
Save to List
39

Fast spherical drawing of triangulations: an experimental study of graph drawing tools
Castelli Aleardi, Luca ; Denis, Gaspard ; Fusy, Eric ; et al.

L'Aquila, Italy ACM: G.: Mathematics of... G.2: DISCRETE MATHEMATIC... G.2.2: Graph Theory G.2.2.0: Graph algorithm... G.2.1: Combinatorics
Conference
Save to List
40

Online firefighting on trees
Coupechoux, Pierre ; Demange, Marc ; Ellison, David ; et al.
International Symposium on Combinatorial Optimization (ISCO 2018), Apr 2018, Marrakech, Morocco

Marrakech, Morocco graph theory Firefighter online trees ACM: G.: Mathematics of...
Conference
Save to List

Filter