Graph Coloring with Minimum Colors: An Easy Approach

Mittal, Amit; Jain, Parash; Mathur, Srushti; Bhatt, Preksha

doi:10.1109/csnt.2011.137

Cited by 9 publications

(9 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…. O algoritmo de coloração de grafos [Mittal et al, 2011] é usado como heurística para classificar nós como benignos ou não. Após a execução do algoritmo, a cor cujos nós em C u i representam a maior quantidade de nós em T u i é classificada como correta, e as outras cores são classificadas como incorretas.…”

Section: Projeto E Implementação Do Trumanunclassified

“…First, it is shown how vehicles can form long-term relationships and trust one another in a similar way to social networks. Then, two algorithms are introduced: Tarjan's strongly connected components algorithm [Tarjan, 1972] and an efficient algorithm for graph coloring [Mittal et al, 2011]. Next, the Malicious Node Identification Algorithm (MaNI) [Vernize, 2013] is explained, because it is the work that suggests the usage of strongly connected components and graph coloring for malicious node detection.…”

Section: Design and Implementation Of Trumanmentioning

confidence: 99%

“…In [Mittal et al, 2011], the authors present an efficient approach to graph coloring using the minimum possible amount of colors. Although they do not prove that their algorithm always uses the smallest possible amount of colors, the output is always a correct coloration and the algorithm is nevertheless efficient.…”

Section: Graph Coloring With Minimum Colorsmentioning

confidence: 99%

“…As a comparison, the DSATUR algorithm for graph coloring has complexity O(|V | 2 ) [Brélaz, 1979]. Algorithm Algorithm 2 shows the general structure of the graph coloring algorithm [Mittal et al, 2011].…”

Section: Graph Coloring With Minimum Colorsmentioning

confidence: 99%

See 3 more Smart Citations

TruMan: Trust Management for Vehicular Networks

Greca

Albini

2018

2018 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

I would like to express my deep gratitude toward my advisor, Professor Luiz Albini, for all the guidance he offered throughout the research that led to this dissertation. His frequent ideas and suggestions were what inspired me to pursue knowledge and be encouraged to find solutions to problems that are far from simple. Furthermore, I would like to thank Professor Eduardo Todt, who has helped me in ways beyond this dissertation, and my fellow students, Eric, Nelson and Ivan, who always brought interesting conversations. I would also like to thank my friends, in particular Taiane, Cainã, Douglas, Lucas and Giancarlo for bringing joy to my life for many years. Perhaps most importantly, I would like to thank my parents, Edison and Lizmari, who supported me throughout the whole process and always reminded me that I was on a path worth pursuing, as well as my grandmother Glacial and everyone in my family. Palavras-chave: redes veiculares, gerenciamento de confiança, identificação de nós maliciosos.

show abstract

Section: Projeto E Implementação Do Trumanunclassified

Section: Design and Implementation Of Trumanmentioning

confidence: 99%

Section: Graph Coloring With Minimum Colorsmentioning

confidence: 99%

Section: Graph Coloring With Minimum Colorsmentioning

confidence: 99%

See 2 more Smart Citations

TruMan: Trust Management for Vehicular Networks

Greca

Albini

2018

2018 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

show abstract

“…GC is a famous NP-complete problem [11]. Given an undirected graph G = (V, E), where V is the set of nodes (i.e.…”

Section: Graph Coloringmentioning

confidence: 99%

Heuristic Scheme for Home Circuit Grouping andWavelength Assignment in LOBS-HC Networks

Yang

Tang

et al. 2014

Journal of Optical Communications

View full text Add to dashboard Cite

Grouping the Home Circuits (HCs) with the same source is a critical issue of Labeled Optical Burst Switching with Home Circuit (LOBS-HC). To maximize the wavelength utilization in LOBS-HC ring networks, an HC grouping and wavelength assignment scheme, called Longest Path Matching and Graph Coloring (LPMGC), is proposed. LPMGC consists of two phases: grouping and wavelength assignment. First, a heuristic algorithm, named Longest Path Matching (LPM), is proposed to group the HCs according to the longest common path matching between HCs and to make each group as large as possible. And then, Graph Coloring (GC) is introduced to assign wavelengths for HC groups. The numerical results show that the proposed scheme performances better than Complementary HC Assignment (CHA) and some other heuristics in both unidirectional and bidirectional LOBS-HC ring networks in terms of wavelength utilization.

show abstract

Register Allocation Based on Boolean Satisfiability

Yang

Liu

2014

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Graph Coloring with Minimum Colors: An Easy Approach

Cited by 9 publications

References 8 publications

TruMan: Trust Management for Vehicular Networks

TruMan: Trust Management for Vehicular Networks

Heuristic Scheme for Home Circuit Grouping andWavelength Assignment in LOBS-HC Networks

Register Allocation Based on Boolean Satisfiability

Contact Info

Product

Resources

About