1101 search results - page 107 / 221 » An Algorithm for the Graph Crossing Number Problem |
273
Voted
ASUNAM
2011
IEEE
14 years 4 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
152
click to vote
ALENEX
2009
15 years 6 months ago
2009
A tanglegram is a pair of trees whose leaf sets are in oneto-one correspondence; matching leaves are connected by inter-tree edges. In applications such as phylogenetics or hierar...
129
click to vote
ATAL
2005
Springer
15 years 10 months ago
2005
Springer
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...
148
Voted
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
139
click to vote
DAM
2002
15 years 4 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...